./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.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-70.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 7ce47381267ee67677a133028db906aae8ff01d6ab9cce9bbfb67fc1f629a942 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:46:57,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:46:57,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:46:57,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:46:57,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:46:57,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:46:57,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:46:57,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:46:57,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:46:57,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:46:57,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:46:57,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:46:57,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:46:57,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:46:57,380 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:46:57,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:46:57,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:46:57,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:46:57,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:46:57,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:46:57,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:46:57,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:46:57,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:46:57,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:46:57,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:46:57,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:46:57,383 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 -> 7ce47381267ee67677a133028db906aae8ff01d6ab9cce9bbfb67fc1f629a942 [2025-03-08 15:46:57,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:46:57,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:46:57,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:46:57,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:46:57,623 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:46:57,623 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-70.i [2025-03-08 15:46:58,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d1df68b/9695f8803f034fd885bc71f65d2b2838/FLAG63ecc696c [2025-03-08 15:46:59,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:46:59,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i [2025-03-08 15:46:59,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d1df68b/9695f8803f034fd885bc71f65d2b2838/FLAG63ecc696c [2025-03-08 15:46:59,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d1df68b/9695f8803f034fd885bc71f65d2b2838 [2025-03-08 15:46:59,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:46:59,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:46:59,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:46:59,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:46:59,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:46:59,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4eecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59, skipping insertion in model container [2025-03-08 15:46:59,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:46:59,409 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-70.i[916,929] [2025-03-08 15:46:59,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:46:59,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:46:59,579 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-70.i[916,929] [2025-03-08 15:46:59,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:46:59,689 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:46:59,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59 WrapperNode [2025-03-08 15:46:59,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:46:59,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:46:59,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:46:59,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:46:59,695 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:46:59" (1/1) ... [2025-03-08 15:46:59,714 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:46:59" (1/1) ... [2025-03-08 15:46:59,798 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 706 [2025-03-08 15:46:59,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:46:59,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:46:59,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:46:59,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:46:59,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,908 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:46:59,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:46:59,977 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:46:59,977 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:46:59,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:46:59,978 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (1/1) ... [2025-03-08 15:46:59,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:46:59,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:00,006 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:00,011 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:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:47:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:47:00,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:47:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:47:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:47:00,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:47:00,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:47:00,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:47:01,022 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~bitwise49#1;havoc property_#t~short50#1;havoc property_#t~ite54#1;havoc property_#t~bitwise51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short55#1;havoc property_#t~ite59#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short60#1; [2025-03-08 15:47:01,127 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-08 15:47:01,129 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:47:01,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:47:01,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:47:01,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:01 BoogieIcfgContainer [2025-03-08 15:47:01,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:47:01,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:47:01,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:47:01,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:47:01,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:46:59" (1/3) ... [2025-03-08 15:47:01,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522e2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:01, skipping insertion in model container [2025-03-08 15:47:01,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:59" (2/3) ... [2025-03-08 15:47:01,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4522e2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:01, skipping insertion in model container [2025-03-08 15:47:01,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:01" (3/3) ... [2025-03-08 15:47:01,163 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-70.i [2025-03-08 15:47:01,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:47:01,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-70.i that has 2 procedures, 280 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:47:01,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:47:01,259 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;@3c452e16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:47:01,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:47:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 217 states have (on average 1.5529953917050692) internal successors, (337), 218 states have internal predecessors, (337), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:47:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:47:01,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:01,285 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:01,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 4180591, now seen corresponding path program 1 times [2025-03-08 15:47:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644246708] [2025-03-08 15:47:01,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:01,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:47:01,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:47:01,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:01,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-03-08 15:47:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:01,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644246708] [2025-03-08 15:47:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644246708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352740304] [2025-03-08 15:47:01,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:01,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:01,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:01,876 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:01,878 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:02,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:47:02,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:47:02,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:02,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:02,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:47:02,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:02,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-03-08 15:47:02,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:47:02,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352740304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:02,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:47:02,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:47:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733353551] [2025-03-08 15:47:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:02,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:47:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:02,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:47:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:47:02,279 INFO L87 Difference]: Start difference. First operand has 280 states, 217 states have (on average 1.5529953917050692) internal successors, (337), 218 states have internal predecessors, (337), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:47:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:02,354 INFO L93 Difference]: Finished difference Result 552 states and 965 transitions. [2025-03-08 15:47:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:47:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 432 [2025-03-08 15:47:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:02,367 INFO L225 Difference]: With dead ends: 552 [2025-03-08 15:47:02,367 INFO L226 Difference]: Without dead ends: 275 [2025-03-08 15:47:02,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 433 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:02,374 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:02,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:47:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-08 15:47:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-08 15:47:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 213 states have (on average 1.5352112676056338) internal successors, (327), 213 states have internal predecessors, (327), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 15:47:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 447 transitions. [2025-03-08 15:47:02,438 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 447 transitions. Word has length 432 [2025-03-08 15:47:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:02,439 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 447 transitions. [2025-03-08 15:47:02,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-03-08 15:47:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 447 transitions. [2025-03-08 15:47:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:47:02,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:02,451 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,459 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:02,651 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:02,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 694440939, now seen corresponding path program 1 times [2025-03-08 15:47:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108034474] [2025-03-08 15:47:02,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:02,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:47:02,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:47:02,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:02,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108034474] [2025-03-08 15:47:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108034474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693373827] [2025-03-08 15:47:03,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:03,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:03,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:03,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:03,165 INFO L87 Difference]: Start difference. First operand 275 states and 447 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:03,293 INFO L93 Difference]: Finished difference Result 762 states and 1242 transitions. [2025-03-08 15:47:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-03-08 15:47:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:03,300 INFO L225 Difference]: With dead ends: 762 [2025-03-08 15:47:03,300 INFO L226 Difference]: Without dead ends: 490 [2025-03-08 15:47:03,302 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:03,302 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 344 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:03,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 847 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-08 15:47:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 487. [2025-03-08 15:47:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 389 states have (on average 1.5526992287917738) internal successors, (604), 390 states have internal predecessors, (604), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-08 15:47:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 794 transitions. [2025-03-08 15:47:03,359 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 794 transitions. Word has length 432 [2025-03-08 15:47:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:03,360 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 794 transitions. [2025-03-08 15:47:03,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 794 transitions. [2025-03-08 15:47:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:47:03,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:03,364 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:47:03,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:03,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -261080340, now seen corresponding path program 1 times [2025-03-08 15:47:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731306465] [2025-03-08 15:47:03,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:03,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:47:03,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:47:03,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:03,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731306465] [2025-03-08 15:47:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731306465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207473862] [2025-03-08 15:47:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:03,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:03,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:03,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:03,735 INFO L87 Difference]: Start difference. First operand 487 states and 794 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:03,894 INFO L93 Difference]: Finished difference Result 1443 states and 2355 transitions. [2025-03-08 15:47:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:03,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-03-08 15:47:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:03,908 INFO L225 Difference]: With dead ends: 1443 [2025-03-08 15:47:03,911 INFO L226 Difference]: Without dead ends: 959 [2025-03-08 15:47:03,913 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:03,914 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 418 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:03,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1021 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-08 15:47:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 529. [2025-03-08 15:47:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 431 states have (on average 1.5638051044083527) internal successors, (674), 432 states have internal predecessors, (674), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-08 15:47:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 864 transitions. [2025-03-08 15:47:03,981 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 864 transitions. Word has length 432 [2025-03-08 15:47:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:03,982 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 864 transitions. [2025-03-08 15:47:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 864 transitions. [2025-03-08 15:47:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:47:03,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:03,985 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:47:03,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1879259767, now seen corresponding path program 1 times [2025-03-08 15:47:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279392923] [2025-03-08 15:47:03,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:04,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:47:04,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:47:04,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:04,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279392923] [2025-03-08 15:47:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279392923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751234928] [2025-03-08 15:47:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:04,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:04,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:04,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:04,431 INFO L87 Difference]: Start difference. First operand 529 states and 864 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:05,256 INFO L93 Difference]: Finished difference Result 3087 states and 5036 transitions. [2025-03-08 15:47:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:47:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-03-08 15:47:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:05,270 INFO L225 Difference]: With dead ends: 3087 [2025-03-08 15:47:05,270 INFO L226 Difference]: Without dead ends: 2561 [2025-03-08 15:47:05,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:05,273 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 2162 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:05,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 2330 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:47:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-03-08 15:47:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1177. [2025-03-08 15:47:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1059 states have (on average 1.627006610009443) internal successors, (1723), 1062 states have internal predecessors, (1723), 113 states have call successors, (113), 4 states have call predecessors, (113), 4 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 15:47:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1949 transitions. [2025-03-08 15:47:05,387 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1949 transitions. Word has length 432 [2025-03-08 15:47:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1949 transitions. [2025-03-08 15:47:05,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1949 transitions. [2025-03-08 15:47:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:47:05,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:05,393 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:47:05,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:05,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash -246455768, now seen corresponding path program 1 times [2025-03-08 15:47:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895279646] [2025-03-08 15:47:05,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:05,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:47:05,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:47:05,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:05,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:05,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:05,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895279646] [2025-03-08 15:47:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895279646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:05,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:05,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883817837] [2025-03-08 15:47:05,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:05,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:05,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:05,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:05,653 INFO L87 Difference]: Start difference. First operand 1177 states and 1949 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:05,836 INFO L93 Difference]: Finished difference Result 3485 states and 5761 transitions. [2025-03-08 15:47:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-03-08 15:47:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:05,848 INFO L225 Difference]: With dead ends: 3485 [2025-03-08 15:47:05,848 INFO L226 Difference]: Without dead ends: 2311 [2025-03-08 15:47:05,852 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:05,854 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 390 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:05,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 825 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2025-03-08 15:47:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1805. [2025-03-08 15:47:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1687 states have (on average 1.6212211025489034) internal successors, (2735), 1690 states have internal predecessors, (2735), 113 states have call successors, (113), 4 states have call predecessors, (113), 4 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 15:47:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2961 transitions. [2025-03-08 15:47:05,969 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2961 transitions. Word has length 432 [2025-03-08 15:47:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:05,970 INFO L471 AbstractCegarLoop]: Abstraction has 1805 states and 2961 transitions. [2025-03-08 15:47:05,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2961 transitions. [2025-03-08 15:47:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-08 15:47:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:05,979 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:47:05,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash 369435381, now seen corresponding path program 1 times [2025-03-08 15:47:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193617638] [2025-03-08 15:47:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:06,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 15:47:06,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 15:47:06,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:06,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:06,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:06,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193617638] [2025-03-08 15:47:06,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193617638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:06,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:06,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:06,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039144752] [2025-03-08 15:47:06,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:06,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:06,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:06,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:06,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:06,618 INFO L87 Difference]: Start difference. First operand 1805 states and 2961 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:06,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:06,988 INFO L93 Difference]: Finished difference Result 5318 states and 8735 transitions. [2025-03-08 15:47:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:06,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 433 [2025-03-08 15:47:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:07,003 INFO L225 Difference]: With dead ends: 5318 [2025-03-08 15:47:07,003 INFO L226 Difference]: Without dead ends: 3516 [2025-03-08 15:47:07,007 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:07,009 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 335 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:07,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1262 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2025-03-08 15:47:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3354. [2025-03-08 15:47:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3174 states have (on average 1.634845620667927) internal successors, (5189), 3177 states have internal predecessors, (5189), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5535 transitions. [2025-03-08 15:47:07,112 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5535 transitions. Word has length 433 [2025-03-08 15:47:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5535 transitions. [2025-03-08 15:47:07,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5535 transitions. [2025-03-08 15:47:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 15:47:07,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:07,118 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:47:07,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:07,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash 980855169, now seen corresponding path program 1 times [2025-03-08 15:47:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680822505] [2025-03-08 15:47:07,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:07,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 15:47:07,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 15:47:07,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:07,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680822505] [2025-03-08 15:47:07,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680822505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:07,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:07,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350418527] [2025-03-08 15:47:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:07,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:07,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:07,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:07,568 INFO L87 Difference]: Start difference. First operand 3354 states and 5535 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:07,992 INFO L93 Difference]: Finished difference Result 6751 states and 11126 transitions. [2025-03-08 15:47:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 434 [2025-03-08 15:47:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:08,009 INFO L225 Difference]: With dead ends: 6751 [2025-03-08 15:47:08,009 INFO L226 Difference]: Without dead ends: 3516 [2025-03-08 15:47:08,015 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:08,015 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 331 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:08,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2025-03-08 15:47:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3358. [2025-03-08 15:47:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3178 states have (on average 1.63373190685966) internal successors, (5192), 3181 states have internal predecessors, (5192), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 5538 transitions. [2025-03-08 15:47:08,123 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 5538 transitions. Word has length 434 [2025-03-08 15:47:08,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:08,123 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 5538 transitions. [2025-03-08 15:47:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 5538 transitions. [2025-03-08 15:47:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:08,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:08,129 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:47:08,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash -584586315, now seen corresponding path program 1 times [2025-03-08 15:47:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:08,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886242450] [2025-03-08 15:47:08,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:08,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:08,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:08,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:08,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:08,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:08,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886242450] [2025-03-08 15:47:08,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886242450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:08,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:08,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659541103] [2025-03-08 15:47:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:08,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:08,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:08,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:08,926 INFO L87 Difference]: Start difference. First operand 3358 states and 5538 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:09,462 INFO L93 Difference]: Finished difference Result 6362 states and 10399 transitions. [2025-03-08 15:47:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:09,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:09,483 INFO L225 Difference]: With dead ends: 6362 [2025-03-08 15:47:09,483 INFO L226 Difference]: Without dead ends: 4328 [2025-03-08 15:47:09,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:09,491 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 794 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:09,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1796 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2025-03-08 15:47:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 3614. [2025-03-08 15:47:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3434 states have (on average 1.6284216656959813) internal successors, (5592), 3437 states have internal predecessors, (5592), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5938 transitions. [2025-03-08 15:47:09,619 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5938 transitions. Word has length 435 [2025-03-08 15:47:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:09,620 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 5938 transitions. [2025-03-08 15:47:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5938 transitions. [2025-03-08 15:47:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:09,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:09,625 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:47:09,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash 950950677, now seen corresponding path program 1 times [2025-03-08 15:47:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219480203] [2025-03-08 15:47:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:09,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:09,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219480203] [2025-03-08 15:47:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219480203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:10,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:10,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391644925] [2025-03-08 15:47:10,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:10,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:10,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:10,344 INFO L87 Difference]: Start difference. First operand 3614 states and 5938 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:11,356 INFO L93 Difference]: Finished difference Result 9212 states and 15016 transitions. [2025-03-08 15:47:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:11,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:11,390 INFO L225 Difference]: With dead ends: 9212 [2025-03-08 15:47:11,393 INFO L226 Difference]: Without dead ends: 7050 [2025-03-08 15:47:11,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:11,401 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1374 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:11,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2305 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:47:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2025-03-08 15:47:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 3862. [2025-03-08 15:47:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3682 states have (on average 1.6338946224877784) internal successors, (6016), 3685 states have internal predecessors, (6016), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 6362 transitions. [2025-03-08 15:47:11,532 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 6362 transitions. Word has length 435 [2025-03-08 15:47:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:11,534 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 6362 transitions. [2025-03-08 15:47:11,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 6362 transitions. [2025-03-08 15:47:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:11,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:11,539 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:47:11,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:11,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -749789802, now seen corresponding path program 1 times [2025-03-08 15:47:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:11,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603344402] [2025-03-08 15:47:11,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:11,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:11,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:11,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:11,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603344402] [2025-03-08 15:47:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603344402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:11,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137757957] [2025-03-08 15:47:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:11,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:11,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:11,749 INFO L87 Difference]: Start difference. First operand 3862 states and 6362 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:11,911 INFO L93 Difference]: Finished difference Result 10154 states and 16662 transitions. [2025-03-08 15:47:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:11,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:11,931 INFO L225 Difference]: With dead ends: 10154 [2025-03-08 15:47:11,931 INFO L226 Difference]: Without dead ends: 6992 [2025-03-08 15:47:11,939 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,939 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 399 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:11,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 919 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2025-03-08 15:47:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6430. [2025-03-08 15:47:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6430 states, 6250 states have (on average 1.61984) internal successors, (10124), 6253 states have internal predecessors, (10124), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 10470 transitions. [2025-03-08 15:47:12,093 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 10470 transitions. Word has length 435 [2025-03-08 15:47:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:12,093 INFO L471 AbstractCegarLoop]: Abstraction has 6430 states and 10470 transitions. [2025-03-08 15:47:12,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 10470 transitions. [2025-03-08 15:47:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:12,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:12,100 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:47:12,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:12,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1345062359, now seen corresponding path program 1 times [2025-03-08 15:47:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754924592] [2025-03-08 15:47:12,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:12,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:12,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:12,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:12,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:12,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754924592] [2025-03-08 15:47:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754924592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:12,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:12,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506036207] [2025-03-08 15:47:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:12,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:12,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:12,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:12,254 INFO L87 Difference]: Start difference. First operand 6430 states and 10470 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:12,465 INFO L93 Difference]: Finished difference Result 12946 states and 21058 transitions. [2025-03-08 15:47:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:12,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:12,488 INFO L225 Difference]: With dead ends: 12946 [2025-03-08 15:47:12,489 INFO L226 Difference]: Without dead ends: 8852 [2025-03-08 15:47:12,498 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,499 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 423 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:12,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 999 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2025-03-08 15:47:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 5990. [2025-03-08 15:47:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 5810 states have (on average 1.6158347676419966) internal successors, (9388), 5813 states have internal predecessors, (9388), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 9734 transitions. [2025-03-08 15:47:12,705 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 9734 transitions. Word has length 435 [2025-03-08 15:47:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:12,706 INFO L471 AbstractCegarLoop]: Abstraction has 5990 states and 9734 transitions. [2025-03-08 15:47:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 9734 transitions. [2025-03-08 15:47:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:12,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:12,715 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:47:12,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:12,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 422378776, now seen corresponding path program 1 times [2025-03-08 15:47:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354427057] [2025-03-08 15:47:12,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:12,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:12,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:12,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:12,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:13,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354427057] [2025-03-08 15:47:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354427057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27770159] [2025-03-08 15:47:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:13,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:13,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:13,351 INFO L87 Difference]: Start difference. First operand 5990 states and 9734 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:13,675 INFO L93 Difference]: Finished difference Result 14478 states and 23362 transitions. [2025-03-08 15:47:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:13,697 INFO L225 Difference]: With dead ends: 14478 [2025-03-08 15:47:13,697 INFO L226 Difference]: Without dead ends: 10336 [2025-03-08 15:47:13,707 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:13,709 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 374 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:13,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1540 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10336 states. [2025-03-08 15:47:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10336 to 7270. [2025-03-08 15:47:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 7090 states have (on average 1.6174894217207334) internal successors, (11468), 7093 states have internal predecessors, (11468), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 11814 transitions. [2025-03-08 15:47:13,874 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 11814 transitions. Word has length 435 [2025-03-08 15:47:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:13,875 INFO L471 AbstractCegarLoop]: Abstraction has 7270 states and 11814 transitions. [2025-03-08 15:47:13,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 11814 transitions. [2025-03-08 15:47:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:13,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:13,882 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:47:13,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1883958775, now seen corresponding path program 1 times [2025-03-08 15:47:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693212658] [2025-03-08 15:47:13,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:13,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:14,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:14,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693212658] [2025-03-08 15:47:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693212658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:14,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:14,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002788023] [2025-03-08 15:47:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:14,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:14,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:14,886 INFO L87 Difference]: Start difference. First operand 7270 states and 11814 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:15,209 INFO L93 Difference]: Finished difference Result 15863 states and 25742 transitions. [2025-03-08 15:47:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:15,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:15,229 INFO L225 Difference]: With dead ends: 15863 [2025-03-08 15:47:15,230 INFO L226 Difference]: Without dead ends: 10481 [2025-03-08 15:47:15,240 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,241 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 968 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:15,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1565 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10481 states. [2025-03-08 15:47:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10481 to 7158. [2025-03-08 15:47:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 6978 states have (on average 1.6147893379191745) internal successors, (11268), 6981 states have internal predecessors, (11268), 173 states have call successors, (173), 6 states have call predecessors, (173), 6 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-08 15:47:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 11614 transitions. [2025-03-08 15:47:15,429 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 11614 transitions. Word has length 435 [2025-03-08 15:47:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:15,429 INFO L471 AbstractCegarLoop]: Abstraction has 7158 states and 11614 transitions. [2025-03-08 15:47:15,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 11614 transitions. [2025-03-08 15:47:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:15,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:15,437 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:47:15,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:15,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1051862644, now seen corresponding path program 1 times [2025-03-08 15:47:15,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:15,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687535367] [2025-03-08 15:47:15,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:15,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:15,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:15,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:16,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687535367] [2025-03-08 15:47:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687535367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960800111] [2025-03-08 15:47:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:16,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:16,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:16,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:16,183 INFO L87 Difference]: Start difference. First operand 7158 states and 11614 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:16,951 INFO L93 Difference]: Finished difference Result 26548 states and 42784 transitions. [2025-03-08 15:47:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:16,990 INFO L225 Difference]: With dead ends: 26548 [2025-03-08 15:47:16,990 INFO L226 Difference]: Without dead ends: 20086 [2025-03-08 15:47:17,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:47:17,008 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1021 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:17,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2193 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:47:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20086 states. [2025-03-08 15:47:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20086 to 13856. [2025-03-08 15:47:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13856 states, 13632 states have (on average 1.6125293427230047) internal successors, (21982), 13639 states have internal predecessors, (21982), 213 states have call successors, (213), 10 states have call predecessors, (213), 10 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-08 15:47:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13856 states to 13856 states and 22408 transitions. [2025-03-08 15:47:17,266 INFO L78 Accepts]: Start accepts. Automaton has 13856 states and 22408 transitions. Word has length 435 [2025-03-08 15:47:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:17,267 INFO L471 AbstractCegarLoop]: Abstraction has 13856 states and 22408 transitions. [2025-03-08 15:47:17,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13856 states and 22408 transitions. [2025-03-08 15:47:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:17,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:17,279 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:47:17,279 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:17,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1984870742, now seen corresponding path program 1 times [2025-03-08 15:47:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:17,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302750871] [2025-03-08 15:47:17,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:17,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:17,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:17,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:17,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:17,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302750871] [2025-03-08 15:47:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302750871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680099662] [2025-03-08 15:47:17,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:17,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:17,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:17,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:17,907 INFO L87 Difference]: Start difference. First operand 13856 states and 22408 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:18,393 INFO L93 Difference]: Finished difference Result 27288 states and 44079 transitions. [2025-03-08 15:47:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:18,427 INFO L225 Difference]: With dead ends: 27288 [2025-03-08 15:47:18,428 INFO L226 Difference]: Without dead ends: 17056 [2025-03-08 15:47:18,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:18,446 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 1069 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:18,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1801 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2025-03-08 15:47:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 13672. [2025-03-08 15:47:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13672 states, 13448 states have (on average 1.6096073765615706) internal successors, (21646), 13455 states have internal predecessors, (21646), 213 states have call successors, (213), 10 states have call predecessors, (213), 10 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-08 15:47:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13672 states to 13672 states and 22072 transitions. [2025-03-08 15:47:18,791 INFO L78 Accepts]: Start accepts. Automaton has 13672 states and 22072 transitions. Word has length 435 [2025-03-08 15:47:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:18,792 INFO L471 AbstractCegarLoop]: Abstraction has 13672 states and 22072 transitions. [2025-03-08 15:47:18,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13672 states and 22072 transitions. [2025-03-08 15:47:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:18,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:18,804 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:47:18,805 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:18,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1969266391, now seen corresponding path program 1 times [2025-03-08 15:47:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888063685] [2025-03-08 15:47:18,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:18,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:18,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:18,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888063685] [2025-03-08 15:47:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888063685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659034154] [2025-03-08 15:47:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:18,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:18,979 INFO L87 Difference]: Start difference. First operand 13672 states and 22072 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:19,460 INFO L93 Difference]: Finished difference Result 27837 states and 44825 transitions. [2025-03-08 15:47:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:19,492 INFO L225 Difference]: With dead ends: 27837 [2025-03-08 15:47:19,492 INFO L226 Difference]: Without dead ends: 15259 [2025-03-08 15:47:19,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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,511 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 920 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:19,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1357 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2025-03-08 15:47:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 7251. [2025-03-08 15:47:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7251 states, 7094 states have (on average 1.6078376092472513) internal successors, (11406), 7097 states have internal predecessors, (11406), 149 states have call successors, (149), 7 states have call predecessors, (149), 7 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-08 15:47:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 11704 transitions. [2025-03-08 15:47:19,681 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 11704 transitions. Word has length 435 [2025-03-08 15:47:19,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:19,682 INFO L471 AbstractCegarLoop]: Abstraction has 7251 states and 11704 transitions. [2025-03-08 15:47:19,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 11704 transitions. [2025-03-08 15:47:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 15:47:19,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:19,690 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:47:19,690 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:19,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1361189528, now seen corresponding path program 1 times [2025-03-08 15:47:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013969821] [2025-03-08 15:47:19,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 15:47:20,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 15:47:20,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:20,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:20,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013969821] [2025-03-08 15:47:20,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013969821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:20,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:20,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734016220] [2025-03-08 15:47:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:20,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:20,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:20,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:20,426 INFO L87 Difference]: Start difference. First operand 7251 states and 11704 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:20,753 INFO L93 Difference]: Finished difference Result 20154 states and 32454 transitions. [2025-03-08 15:47:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-03-08 15:47:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:20,779 INFO L225 Difference]: With dead ends: 20154 [2025-03-08 15:47:20,779 INFO L226 Difference]: Without dead ends: 13151 [2025-03-08 15:47:20,788 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:20,789 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 579 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:20,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1183 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-03-08 15:47:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 6955. [2025-03-08 15:47:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6955 states, 6798 states have (on average 1.5989997057958223) internal successors, (10870), 6801 states have internal predecessors, (10870), 149 states have call successors, (149), 7 states have call predecessors, (149), 7 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-08 15:47:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 11168 transitions. [2025-03-08 15:47:20,921 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 11168 transitions. Word has length 435 [2025-03-08 15:47:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:20,921 INFO L471 AbstractCegarLoop]: Abstraction has 6955 states and 11168 transitions. [2025-03-08 15:47:20,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 11168 transitions. [2025-03-08 15:47:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 15:47:20,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:20,928 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:47:20,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1262710541, now seen corresponding path program 1 times [2025-03-08 15:47:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554409588] [2025-03-08 15:47:20,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:20,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 15:47:21,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 15:47:21,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:21,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:21,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:21,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554409588] [2025-03-08 15:47:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554409588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:21,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:21,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952754324] [2025-03-08 15:47:21,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:21,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:21,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:21,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:21,773 INFO L87 Difference]: Start difference. First operand 6955 states and 11168 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:22,152 INFO L93 Difference]: Finished difference Result 16661 states and 26704 transitions. [2025-03-08 15:47:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-03-08 15:47:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:22,179 INFO L225 Difference]: With dead ends: 16661 [2025-03-08 15:47:22,179 INFO L226 Difference]: Without dead ends: 10098 [2025-03-08 15:47:22,187 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:22,188 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 692 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:22,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1617 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2025-03-08 15:47:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 6915. [2025-03-08 15:47:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6915 states, 6758 states have (on average 1.5930748742231429) internal successors, (10766), 6761 states have internal predecessors, (10766), 149 states have call successors, (149), 7 states have call predecessors, (149), 7 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-08 15:47:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6915 states to 6915 states and 11064 transitions. [2025-03-08 15:47:22,308 INFO L78 Accepts]: Start accepts. Automaton has 6915 states and 11064 transitions. Word has length 436 [2025-03-08 15:47:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 6915 states and 11064 transitions. [2025-03-08 15:47:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6915 states and 11064 transitions. [2025-03-08 15:47:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 15:47:22,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:22,315 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:47:22,315 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:22,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 878008305, now seen corresponding path program 1 times [2025-03-08 15:47:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:22,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175798340] [2025-03-08 15:47:22,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:22,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 15:47:22,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 15:47:22,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:22,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175798340] [2025-03-08 15:47:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175798340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:23,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231763293] [2025-03-08 15:47:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:23,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:23,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:23,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:23,405 INFO L87 Difference]: Start difference. First operand 6915 states and 11064 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:23,949 INFO L93 Difference]: Finished difference Result 15900 states and 25249 transitions. [2025-03-08 15:47:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-03-08 15:47:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:23,970 INFO L225 Difference]: With dead ends: 15900 [2025-03-08 15:47:23,971 INFO L226 Difference]: Without dead ends: 12129 [2025-03-08 15:47:23,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:23,979 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 661 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:23,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1563 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12129 states. [2025-03-08 15:47:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12129 to 9528. [2025-03-08 15:47:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9528 states, 9324 states have (on average 1.5915915915915917) internal successors, (14840), 9331 states have internal predecessors, (14840), 191 states have call successors, (191), 12 states have call predecessors, (191), 12 states have return successors, (191), 184 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-08 15:47:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9528 states to 9528 states and 15222 transitions. [2025-03-08 15:47:24,146 INFO L78 Accepts]: Start accepts. Automaton has 9528 states and 15222 transitions. Word has length 436 [2025-03-08 15:47:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:24,147 INFO L471 AbstractCegarLoop]: Abstraction has 9528 states and 15222 transitions. [2025-03-08 15:47:24,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 9528 states and 15222 transitions. [2025-03-08 15:47:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 15:47:24,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:24,154 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:47:24,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:24,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 951965298, now seen corresponding path program 1 times [2025-03-08 15:47:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20693243] [2025-03-08 15:47:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:24,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 15:47:24,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 15:47:24,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:24,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:24,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:24,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20693243] [2025-03-08 15:47:24,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20693243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:24,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291161395] [2025-03-08 15:47:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:24,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:24,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:24,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:24,669 INFO L87 Difference]: Start difference. First operand 9528 states and 15222 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:25,132 INFO L93 Difference]: Finished difference Result 16290 states and 25993 transitions. [2025-03-08 15:47:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:25,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-03-08 15:47:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:25,161 INFO L225 Difference]: With dead ends: 16290 [2025-03-08 15:47:25,165 INFO L226 Difference]: Without dead ends: 10784 [2025-03-08 15:47:25,176 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:25,179 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 418 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:25,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1459 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10784 states. [2025-03-08 15:47:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10784 to 9584. [2025-03-08 15:47:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9584 states, 9380 states have (on average 1.5918976545842218) internal successors, (14932), 9387 states have internal predecessors, (14932), 191 states have call successors, (191), 12 states have call predecessors, (191), 12 states have return successors, (191), 184 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-08 15:47:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9584 states to 9584 states and 15314 transitions. [2025-03-08 15:47:25,461 INFO L78 Accepts]: Start accepts. Automaton has 9584 states and 15314 transitions. Word has length 436 [2025-03-08 15:47:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:25,464 INFO L471 AbstractCegarLoop]: Abstraction has 9584 states and 15314 transitions. [2025-03-08 15:47:25,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 9584 states and 15314 transitions. [2025-03-08 15:47:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 15:47:25,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:25,471 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 15:47:25,472 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:25,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -3555981, now seen corresponding path program 1 times [2025-03-08 15:47:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420689291] [2025-03-08 15:47:25,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:25,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 15:47:25,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 15:47:25,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:25,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420689291] [2025-03-08 15:47:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420689291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:25,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845654680] [2025-03-08 15:47:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:25,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:25,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:25,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:25,687 INFO L87 Difference]: Start difference. First operand 9584 states and 15314 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:25,918 INFO L93 Difference]: Finished difference Result 16544 states and 26425 transitions. [2025-03-08 15:47:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:25,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-03-08 15:47:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:25,937 INFO L225 Difference]: With dead ends: 16544 [2025-03-08 15:47:25,938 INFO L226 Difference]: Without dead ends: 9600 [2025-03-08 15:47:25,947 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:25,948 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 213 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:25,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1070 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2025-03-08 15:47:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 6550. [2025-03-08 15:47:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6550 states, 6387 states have (on average 1.5855644277438548) internal successors, (10127), 6390 states have internal predecessors, (10127), 151 states have call successors, (151), 11 states have call predecessors, (151), 11 states have return successors, (151), 148 states have call predecessors, (151), 151 states have call successors, (151) [2025-03-08 15:47:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 10429 transitions. [2025-03-08 15:47:26,110 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 10429 transitions. Word has length 436 [2025-03-08 15:47:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:26,113 INFO L471 AbstractCegarLoop]: Abstraction has 6550 states and 10429 transitions. [2025-03-08 15:47:26,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 10429 transitions. [2025-03-08 15:47:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 15:47:26,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:26,118 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:47:26,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:26,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1400786480, now seen corresponding path program 1 times [2025-03-08 15:47:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642798577] [2025-03-08 15:47:26,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:26,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 15:47:26,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 15:47:26,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:26,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:26,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:26,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642798577] [2025-03-08 15:47:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642798577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531601764] [2025-03-08 15:47:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:26,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:26,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:26,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:26,948 INFO L87 Difference]: Start difference. First operand 6550 states and 10429 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:27,270 INFO L93 Difference]: Finished difference Result 13120 states and 20934 transitions. [2025-03-08 15:47:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:27,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-03-08 15:47:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:27,288 INFO L225 Difference]: With dead ends: 13120 [2025-03-08 15:47:27,288 INFO L226 Difference]: Without dead ends: 7798 [2025-03-08 15:47:27,294 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:27,296 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 510 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:27,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 939 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2025-03-08 15:47:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 4490. [2025-03-08 15:47:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 4344 states have (on average 1.5587016574585635) internal successors, (6771), 4345 states have internal predecessors, (6771), 133 states have call successors, (133), 12 states have call predecessors, (133), 12 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-08 15:47:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 7037 transitions. [2025-03-08 15:47:27,413 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 7037 transitions. Word has length 437 [2025-03-08 15:47:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:27,414 INFO L471 AbstractCegarLoop]: Abstraction has 4490 states and 7037 transitions. [2025-03-08 15:47:27,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 7037 transitions. [2025-03-08 15:47:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 15:47:27,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:27,418 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 15:47:27,419 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:27,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1597535663, now seen corresponding path program 1 times [2025-03-08 15:47:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:27,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008925939] [2025-03-08 15:47:27,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 15:47:27,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 15:47:27,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:27,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008925939] [2025-03-08 15:47:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008925939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:28,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583719423] [2025-03-08 15:47:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:28,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:28,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:28,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:28,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:28,261 INFO L87 Difference]: Start difference. First operand 4490 states and 7037 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:29,078 INFO L93 Difference]: Finished difference Result 12060 states and 18937 transitions. [2025-03-08 15:47:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:47:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-03-08 15:47:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:29,094 INFO L225 Difference]: With dead ends: 12060 [2025-03-08 15:47:29,095 INFO L226 Difference]: Without dead ends: 8952 [2025-03-08 15:47:29,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:29,101 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1146 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:29,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1914 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:47:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8952 states. [2025-03-08 15:47:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8952 to 5690. [2025-03-08 15:47:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5544 states have (on average 1.5604256854256855) internal successors, (8651), 5545 states have internal predecessors, (8651), 133 states have call successors, (133), 12 states have call predecessors, (133), 12 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-08 15:47:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8917 transitions. [2025-03-08 15:47:29,234 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8917 transitions. Word has length 437 [2025-03-08 15:47:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8917 transitions. [2025-03-08 15:47:29,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8917 transitions. [2025-03-08 15:47:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 15:47:29,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:29,240 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 15:47:29,240 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:29,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1444296718, now seen corresponding path program 1 times [2025-03-08 15:47:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067681646] [2025-03-08 15:47:29,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 15:47:29,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 15:47:29,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:29,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067681646] [2025-03-08 15:47:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067681646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267690437] [2025-03-08 15:47:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:29,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:29,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:29,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:29,946 INFO L87 Difference]: Start difference. First operand 5690 states and 8917 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:30,335 INFO L93 Difference]: Finished difference Result 10020 states and 15715 transitions. [2025-03-08 15:47:30,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:30,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-03-08 15:47:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:30,346 INFO L225 Difference]: With dead ends: 10020 [2025-03-08 15:47:30,347 INFO L226 Difference]: Without dead ends: 6756 [2025-03-08 15:47:30,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:30,354 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 459 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:30,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1628 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2025-03-08 15:47:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6753. [2025-03-08 15:47:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6753 states, 6568 states have (on average 1.5552679658952497) internal successors, (10215), 6570 states have internal predecessors, (10215), 168 states have call successors, (168), 16 states have call predecessors, (168), 16 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-08 15:47:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6753 states to 6753 states and 10551 transitions. [2025-03-08 15:47:30,505 INFO L78 Accepts]: Start accepts. Automaton has 6753 states and 10551 transitions. Word has length 437 [2025-03-08 15:47:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 6753 states and 10551 transitions. [2025-03-08 15:47:30,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6753 states and 10551 transitions. [2025-03-08 15:47:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-08 15:47:30,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:30,510 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 15:47:30,511 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:30,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:30,511 INFO L85 PathProgramCache]: Analyzing trace with hash 766812528, now seen corresponding path program 1 times [2025-03-08 15:47:30,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:30,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822677524] [2025-03-08 15:47:30,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:30,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 15:47:31,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 15:47:31,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:31,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3 proven. 174 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:47:32,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:32,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822677524] [2025-03-08 15:47:32,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822677524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:32,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215098985] [2025-03-08 15:47:32,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:32,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:32,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:32,047 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:32,049 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:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-08 15:47:32,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-08 15:47:32,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:32,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:32,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:32,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3293 proven. 114 refuted. 0 times theorem prover too weak. 3673 trivial. 0 not checked. [2025-03-08 15:47:32,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 63 proven. 114 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:47:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215098985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:33,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:33,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2025-03-08 15:47:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824502078] [2025-03-08 15:47:33,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:33,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:47:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:33,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:47:33,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:47:33,259 INFO L87 Difference]: Start difference. First operand 6753 states and 10551 transitions. Second operand has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 5 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-03-08 15:47:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:34,637 INFO L93 Difference]: Finished difference Result 13599 states and 21206 transitions. [2025-03-08 15:47:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 15:47:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 5 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) Word has length 437 [2025-03-08 15:47:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:34,648 INFO L225 Difference]: With dead ends: 13599 [2025-03-08 15:47:34,649 INFO L226 Difference]: Without dead ends: 6978 [2025-03-08 15:47:34,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:47:34,656 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1159 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:34,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 2422 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:47:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2025-03-08 15:47:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6769. [2025-03-08 15:47:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6769 states, 6580 states have (on average 1.5322188449848024) internal successors, (10082), 6582 states have internal predecessors, (10082), 168 states have call successors, (168), 20 states have call predecessors, (168), 20 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-08 15:47:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 10418 transitions. [2025-03-08 15:47:34,824 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 10418 transitions. Word has length 437 [2025-03-08 15:47:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:34,825 INFO L471 AbstractCegarLoop]: Abstraction has 6769 states and 10418 transitions. [2025-03-08 15:47:34,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.53846153846154) internal successors, (319), 13 states have internal predecessors, (319), 5 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-03-08 15:47:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 10418 transitions. [2025-03-08 15:47:34,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-08 15:47:34,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:34,831 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,840 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:35,031 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,SelfDestructingSolverStorable24 [2025-03-08 15:47:35,031 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:35,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 615685318, now seen corresponding path program 1 times [2025-03-08 15:47:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000503453] [2025-03-08 15:47:35,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:35,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-08 15:47:35,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-08 15:47:35,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:35,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 36 proven. 141 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:47:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000503453] [2025-03-08 15:47:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000503453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28831329] [2025-03-08 15:47:36,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:36,103 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:36,106 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:36,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-08 15:47:36,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-08 15:47:36,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:36,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:36,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:47:36,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3557 proven. 78 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2025-03-08 15:47:36,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 99 proven. 78 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-03-08 15:47:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28831329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:36,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-08 15:47:36,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699555169] [2025-03-08 15:47:36,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:36,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:47:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:36,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:47:36,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:47:36,904 INFO L87 Difference]: Start difference. First operand 6769 states and 10418 transitions. Second operand has 13 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) [2025-03-08 15:47:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:37,790 INFO L93 Difference]: Finished difference Result 10571 states and 16292 transitions. [2025-03-08 15:47:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:47:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) Word has length 438 [2025-03-08 15:47:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:37,797 INFO L225 Difference]: With dead ends: 10571 [2025-03-08 15:47:37,797 INFO L226 Difference]: Without dead ends: 4188 [2025-03-08 15:47:37,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:47:37,803 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1050 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:37,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1588 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:47:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-03-08 15:47:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 2475. [2025-03-08 15:47:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2337 states have (on average 1.5143346170303809) internal successors, (3539), 2337 states have internal predecessors, (3539), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:47:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3779 transitions. [2025-03-08 15:47:37,881 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3779 transitions. Word has length 438 [2025-03-08 15:47:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:37,881 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3779 transitions. [2025-03-08 15:47:37,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.692307692307693) internal successors, (282), 13 states have internal predecessors, (282), 4 states have call successors, (133), 2 states have call predecessors, (133), 4 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) [2025-03-08 15:47:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3779 transitions. [2025-03-08 15:47:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-08 15:47:37,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:37,884 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,893 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:38,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:38,086 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1726718390, now seen corresponding path program 1 times [2025-03-08 15:47:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245480354] [2025-03-08 15:47:38,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:38,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-08 15:47:38,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-08 15:47:38,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:38,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245480354] [2025-03-08 15:47:38,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245480354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:38,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:38,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124842208] [2025-03-08 15:47:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:38,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:38,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:38,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:38,222 INFO L87 Difference]: Start difference. First operand 2475 states and 3779 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:38,375 INFO L93 Difference]: Finished difference Result 4522 states and 6922 transitions. [2025-03-08 15:47:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-03-08 15:47:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:38,381 INFO L225 Difference]: With dead ends: 4522 [2025-03-08 15:47:38,381 INFO L226 Difference]: Without dead ends: 2961 [2025-03-08 15:47:38,383 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:38,383 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 203 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 934 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:38,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 934 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:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2025-03-08 15:47:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2755. [2025-03-08 15:47:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2617 states have (on average 1.5051585785250288) internal successors, (3939), 2617 states have internal predecessors, (3939), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:47:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 4179 transitions. [2025-03-08 15:47:38,460 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 4179 transitions. Word has length 438 [2025-03-08 15:47:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:38,461 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 4179 transitions. [2025-03-08 15:47:38,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 4179 transitions. [2025-03-08 15:47:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-08 15:47:38,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:38,464 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 15:47:38,465 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1308943764, now seen corresponding path program 1 times [2025-03-08 15:47:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914378332] [2025-03-08 15:47:38,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:38,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-08 15:47:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-08 15:47:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914378332] [2025-03-08 15:47:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914378332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:39,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281070810] [2025-03-08 15:47:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:39,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:39,387 INFO L87 Difference]: Start difference. First operand 2755 states and 4179 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:40,255 INFO L93 Difference]: Finished difference Result 9102 states and 13843 transitions. [2025-03-08 15:47:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:47:40,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-03-08 15:47:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:40,267 INFO L225 Difference]: With dead ends: 9102 [2025-03-08 15:47:40,267 INFO L226 Difference]: Without dead ends: 7585 [2025-03-08 15:47:40,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:47:40,271 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 1882 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:40,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 2929 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:47:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7585 states. [2025-03-08 15:47:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7585 to 3083. [2025-03-08 15:47:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2945 states have (on average 1.500509337860781) internal successors, (4419), 2945 states have internal predecessors, (4419), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:47:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 4659 transitions. [2025-03-08 15:47:40,365 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 4659 transitions. Word has length 439 [2025-03-08 15:47:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:40,366 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 4659 transitions. [2025-03-08 15:47:40,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 4659 transitions. [2025-03-08 15:47:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-08 15:47:40,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:40,369 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 15:47:40,369 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:40,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1208031797, now seen corresponding path program 1 times [2025-03-08 15:47:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:40,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647084263] [2025-03-08 15:47:40,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:40,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:40,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-08 15:47:40,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-08 15:47:40,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:40,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647084263] [2025-03-08 15:47:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647084263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:40,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:40,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891655213] [2025-03-08 15:47:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:40,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:40,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:40,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:40,953 INFO L87 Difference]: Start difference. First operand 3083 states and 4659 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:41,250 INFO L93 Difference]: Finished difference Result 6413 states and 9728 transitions. [2025-03-08 15:47:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-03-08 15:47:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:41,256 INFO L225 Difference]: With dead ends: 6413 [2025-03-08 15:47:41,256 INFO L226 Difference]: Without dead ends: 4588 [2025-03-08 15:47:41,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:41,259 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 849 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:41,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1154 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2025-03-08 15:47:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 3475. [2025-03-08 15:47:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3337 states have (on average 1.503446209169913) internal successors, (5017), 3337 states have internal predecessors, (5017), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:47:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 5257 transitions. [2025-03-08 15:47:41,346 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 5257 transitions. Word has length 439 [2025-03-08 15:47:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:41,346 INFO L471 AbstractCegarLoop]: Abstraction has 3475 states and 5257 transitions. [2025-03-08 15:47:41,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 5257 transitions. [2025-03-08 15:47:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-08 15:47:41,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:41,350 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 15:47:41,350 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 303857412, now seen corresponding path program 1 times [2025-03-08 15:47:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742685353] [2025-03-08 15:47:41,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:41,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:41,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-08 15:47:41,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-08 15:47:41,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:41,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-03-08 15:47:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742685353] [2025-03-08 15:47:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742685353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830683379] [2025-03-08 15:47:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:41,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:41,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:41,846 INFO L87 Difference]: Start difference. First operand 3475 states and 5257 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:42,320 INFO L93 Difference]: Finished difference Result 6585 states and 9933 transitions. [2025-03-08 15:47:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:42,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-03-08 15:47:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:42,327 INFO L225 Difference]: With dead ends: 6585 [2025-03-08 15:47:42,327 INFO L226 Difference]: Without dead ends: 3958 [2025-03-08 15:47:42,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:42,331 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 606 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:42,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 2501 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2025-03-08 15:47:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3019. [2025-03-08 15:47:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2881 states have (on average 1.455397431447414) internal successors, (4193), 2881 states have internal predecessors, (4193), 120 states have call successors, (120), 17 states have call predecessors, (120), 17 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-08 15:47:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4433 transitions. [2025-03-08 15:47:42,414 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4433 transitions. Word has length 439 [2025-03-08 15:47:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:42,414 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 4433 transitions. [2025-03-08 15:47:42,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-03-08 15:47:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4433 transitions. [2025-03-08 15:47:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-08 15:47:42,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:42,417 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 15:47:42,417 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:42,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -720836509, now seen corresponding path program 1 times [2025-03-08 15:47:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:42,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080508872] [2025-03-08 15:47:42,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:42,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-08 15:47:43,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-08 15:47:43,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:43,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat