./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.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 202a0432e117f9058bd61aa67403e31b42b1f3767a8cd5b20aabf9e04f737968 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:14,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:14,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:14,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:14,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:14,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:14,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:14,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:14,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:14,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:14,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:14,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:14,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:14,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:14,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:14,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:14,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:14,381 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 -> 202a0432e117f9058bd61aa67403e31b42b1f3767a8cd5b20aabf9e04f737968 [2025-03-04 00:07:14,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:14,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:14,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:14,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:14,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:14,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.i [2025-03-04 00:07:15,991 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64dd56184/65f8186bac2a4875986f4ca530038090/FLAG8422ed513 [2025-03-04 00:07:16,259 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:16,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-1.i [2025-03-04 00:07:16,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64dd56184/65f8186bac2a4875986f4ca530038090/FLAG8422ed513 [2025-03-04 00:07:16,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64dd56184/65f8186bac2a4875986f4ca530038090 [2025-03-04 00:07:16,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:16,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:16,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:16,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:16,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:16,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ff618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16, skipping insertion in model container [2025-03-04 00:07:16,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:16,454 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_amount250_file-1.i[915,928] [2025-03-04 00:07:16,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:16,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:16,624 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_amount250_file-1.i[915,928] [2025-03-04 00:07:16,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:16,704 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:16,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16 WrapperNode [2025-03-04 00:07:16,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:16,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:16,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:16,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:16,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,769 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 397 [2025-03-04 00:07:16,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:16,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:16,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:16,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:16,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,819 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-04 00:07:16,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:16,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:16,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:16,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:16,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (1/1) ... [2025-03-04 00:07:16,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:16,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:16,912 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-04 00:07:16,918 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-04 00:07:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:17,036 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:17,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:17,647 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc property_#t~ite33#1;havoc property_#t~bitwise31#1;havoc property_#t~bitwise32#1; [2025-03-04 00:07:17,704 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:17,705 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:17,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:17,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:17,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:17 BoogieIcfgContainer [2025-03-04 00:07:17,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:17,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:17,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:17,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:17,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:16" (1/3) ... [2025-03-04 00:07:17,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b76050b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:17, skipping insertion in model container [2025-03-04 00:07:17,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:16" (2/3) ... [2025-03-04 00:07:17,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b76050b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:17, skipping insertion in model container [2025-03-04 00:07:17,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:17" (3/3) ... [2025-03-04 00:07:17,729 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-1.i [2025-03-04 00:07:17,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:17,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-1.i that has 2 procedures, 157 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:17,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:17,815 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;@2732f74a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:17,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 112 states have internal predecessors, (172), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:07:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:07:17,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:17,838 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:17,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:17,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:17,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1992689559, now seen corresponding path program 1 times [2025-03-04 00:07:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153266555] [2025-03-04 00:07:17,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:18,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:07:18,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:07:18,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:18,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:07:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153266555] [2025-03-04 00:07:18,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153266555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:18,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636746112] [2025-03-04 00:07:18,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:18,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:18,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:18,386 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-04 00:07:18,387 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-04 00:07:18,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:07:18,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:07:18,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:18,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:18,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:18,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:07:18,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636746112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:07:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930130656] [2025-03-04 00:07:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:18,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:18,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:18,729 INFO L87 Difference]: Start difference. First operand has 157 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 112 states have internal predecessors, (172), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:07:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:18,776 INFO L93 Difference]: Finished difference Result 308 states and 554 transitions. [2025-03-04 00:07:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:18,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2025-03-04 00:07:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:18,785 INFO L225 Difference]: With dead ends: 308 [2025-03-04 00:07:18,785 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 00:07:18,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 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-04 00:07:18,791 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:18,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 00:07:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 00:07:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 109 states have internal predecessors, (167), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:07:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 253 transitions. [2025-03-04 00:07:18,845 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 253 transitions. Word has length 285 [2025-03-04 00:07:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 253 transitions. [2025-03-04 00:07:18,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:07:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 253 transitions. [2025-03-04 00:07:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:07:18,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:18,855 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:18,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:07:19,055 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-04 00:07:19,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:19,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 660342828, now seen corresponding path program 1 times [2025-03-04 00:07:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942412015] [2025-03-04 00:07:19,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:19,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:19,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:07:19,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:07:19,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:19,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942412015] [2025-03-04 00:07:19,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942412015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:19,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:19,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:19,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255469136] [2025-03-04 00:07:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:19,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:19,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:19,432 INFO L87 Difference]: Start difference. First operand 154 states and 253 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:19,517 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2025-03-04 00:07:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:19,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-03-04 00:07:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:19,521 INFO L225 Difference]: With dead ends: 372 [2025-03-04 00:07:19,521 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 00:07:19,522 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-04 00:07:19,522 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 106 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:19,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 474 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 00:07:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2025-03-04 00:07:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 117 states have internal predecessors, (180), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:07:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 266 transitions. [2025-03-04 00:07:19,537 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 266 transitions. Word has length 285 [2025-03-04 00:07:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 266 transitions. [2025-03-04 00:07:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 266 transitions. [2025-03-04 00:07:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:07:19,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:19,543 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:19,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:19,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:19,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 691362635, now seen corresponding path program 1 times [2025-03-04 00:07:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:19,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997893199] [2025-03-04 00:07:19,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:19,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:07:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:07:19,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:19,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997893199] [2025-03-04 00:07:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997893199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:20,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909222507] [2025-03-04 00:07:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:20,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:20,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:20,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:20,309 INFO L87 Difference]: Start difference. First operand 162 states and 266 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:20,394 INFO L93 Difference]: Finished difference Result 480 states and 792 transitions. [2025-03-04 00:07:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-03-04 00:07:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:20,397 INFO L225 Difference]: With dead ends: 480 [2025-03-04 00:07:20,400 INFO L226 Difference]: Without dead ends: 321 [2025-03-04 00:07:20,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04 00:07:20,402 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 152 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 480 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-04 00:07:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-03-04 00:07:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 230 states have (on average 1.5391304347826087) internal successors, (354), 230 states have internal predecessors, (354), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:07:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 526 transitions. [2025-03-04 00:07:20,459 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 526 transitions. Word has length 285 [2025-03-04 00:07:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:20,460 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 526 transitions. [2025-03-04 00:07:20,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 526 transitions. [2025-03-04 00:07:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:07:20,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:20,464 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:20,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:07:20,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2044672332, now seen corresponding path program 1 times [2025-03-04 00:07:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:20,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292272313] [2025-03-04 00:07:20,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:20,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:07:20,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:07:20,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:20,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292272313] [2025-03-04 00:07:21,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292272313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:21,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:07:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67861192] [2025-03-04 00:07:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:21,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:07:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:21,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:07:21,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:21,738 INFO L87 Difference]: Start difference. First operand 319 states and 526 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:22,288 INFO L93 Difference]: Finished difference Result 834 states and 1377 transitions. [2025-03-04 00:07:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:07:22,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-03-04 00:07:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:22,294 INFO L225 Difference]: With dead ends: 834 [2025-03-04 00:07:22,294 INFO L226 Difference]: Without dead ends: 518 [2025-03-04 00:07:22,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:07:22,297 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 183 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:22,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 835 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:07:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-04 00:07:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 398. [2025-03-04 00:07:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 00:07:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 650 transitions. [2025-03-04 00:07:22,386 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 650 transitions. Word has length 285 [2025-03-04 00:07:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:22,387 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 650 transitions. [2025-03-04 00:07:22,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 650 transitions. [2025-03-04 00:07:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-04 00:07:22,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:22,391 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:22,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:07:22,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:22,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:22,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1920529203, now seen corresponding path program 1 times [2025-03-04 00:07:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026017695] [2025-03-04 00:07:22,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:22,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-04 00:07:22,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-04 00:07:22,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:22,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026017695] [2025-03-04 00:07:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026017695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:07:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651374923] [2025-03-04 00:07:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:07:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:23,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:07:23,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:23,106 INFO L87 Difference]: Start difference. First operand 398 states and 650 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:23,561 INFO L93 Difference]: Finished difference Result 922 states and 1523 transitions. [2025-03-04 00:07:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:07:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 285 [2025-03-04 00:07:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:23,568 INFO L225 Difference]: With dead ends: 922 [2025-03-04 00:07:23,569 INFO L226 Difference]: Without dead ends: 606 [2025-03-04 00:07:23,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:07:23,571 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 342 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:23,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 931 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:07:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-04 00:07:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2025-03-04 00:07:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 351 states have (on average 1.5356125356125356) internal successors, (539), 351 states have internal predecessors, (539), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 00:07:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 797 transitions. [2025-03-04 00:07:23,676 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 797 transitions. Word has length 285 [2025-03-04 00:07:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:23,677 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 797 transitions. [2025-03-04 00:07:23,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 797 transitions. [2025-03-04 00:07:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:23,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:23,684 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:07:23,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash -728237487, now seen corresponding path program 1 times [2025-03-04 00:07:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216962561] [2025-03-04 00:07:23,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:23,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:23,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:23,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:23,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216962561] [2025-03-04 00:07:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216962561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696244157] [2025-03-04 00:07:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:24,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:24,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:24,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:24,256 INFO L87 Difference]: Start difference. First operand 484 states and 797 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:24,514 INFO L93 Difference]: Finished difference Result 993 states and 1647 transitions. [2025-03-04 00:07:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:24,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 287 [2025-03-04 00:07:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:24,519 INFO L225 Difference]: With dead ends: 993 [2025-03-04 00:07:24,519 INFO L226 Difference]: Without dead ends: 592 [2025-03-04 00:07:24,521 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-04 00:07:24,521 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 170 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:24,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 725 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-04 00:07:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 484. [2025-03-04 00:07:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 351 states have (on average 1.5327635327635327) internal successors, (538), 351 states have internal predecessors, (538), 129 states have call successors, (129), 3 states have call predecessors, (129), 3 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 00:07:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 796 transitions. [2025-03-04 00:07:24,584 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 796 transitions. Word has length 287 [2025-03-04 00:07:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:24,585 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 796 transitions. [2025-03-04 00:07:24,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 796 transitions. [2025-03-04 00:07:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:24,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:24,590 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:24,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:07:24,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:24,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash 904566512, now seen corresponding path program 1 times [2025-03-04 00:07:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253301396] [2025-03-04 00:07:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:24,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:24,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:24,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:24,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253301396] [2025-03-04 00:07:27,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253301396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:27,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:27,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 00:07:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510831213] [2025-03-04 00:07:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:27,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:07:27,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:27,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:07:27,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:07:27,764 INFO L87 Difference]: Start difference. First operand 484 states and 796 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 4 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2025-03-04 00:07:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:31,571 INFO L93 Difference]: Finished difference Result 2048 states and 3454 transitions. [2025-03-04 00:07:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:07:31,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 4 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 287 [2025-03-04 00:07:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:31,581 INFO L225 Difference]: With dead ends: 2048 [2025-03-04 00:07:31,581 INFO L226 Difference]: Without dead ends: 1668 [2025-03-04 00:07:31,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:07:31,584 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 3456 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:31,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 2270 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 00:07:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-04 00:07:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 602. [2025-03-04 00:07:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 468 states have (on average 1.5705128205128205) internal successors, (735), 468 states have internal predecessors, (735), 129 states have call successors, (129), 4 states have call predecessors, (129), 4 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 00:07:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 993 transitions. [2025-03-04 00:07:31,649 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 993 transitions. Word has length 287 [2025-03-04 00:07:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:31,650 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 993 transitions. [2025-03-04 00:07:31,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 4 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2025-03-04 00:07:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 993 transitions. [2025-03-04 00:07:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:31,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:31,653 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:31,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:07:31,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 837559759, now seen corresponding path program 1 times [2025-03-04 00:07:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652109271] [2025-03-04 00:07:31,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:31,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:31,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652109271] [2025-03-04 00:07:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652109271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:07:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518090285] [2025-03-04 00:07:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:32,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:07:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:07:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:07:32,710 INFO L87 Difference]: Start difference. First operand 602 states and 993 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:07:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:34,444 INFO L93 Difference]: Finished difference Result 2492 states and 4179 transitions. [2025-03-04 00:07:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:07:34,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 287 [2025-03-04 00:07:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:34,454 INFO L225 Difference]: With dead ends: 2492 [2025-03-04 00:07:34,454 INFO L226 Difference]: Without dead ends: 2138 [2025-03-04 00:07:34,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:07:34,457 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1753 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:34,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2434 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:07:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-03-04 00:07:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1197. [2025-03-04 00:07:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 975 states have (on average 1.6164102564102565) internal successors, (1576), 975 states have internal predecessors, (1576), 215 states have call successors, (215), 6 states have call predecessors, (215), 6 states have return successors, (215), 215 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-04 00:07:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2006 transitions. [2025-03-04 00:07:34,549 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2006 transitions. Word has length 287 [2025-03-04 00:07:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:34,549 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 2006 transitions. [2025-03-04 00:07:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:07:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2006 transitions. [2025-03-04 00:07:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:34,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:34,553 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:34,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:07:34,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:34,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1930058511, now seen corresponding path program 1 times [2025-03-04 00:07:34,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:34,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019088569] [2025-03-04 00:07:34,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:34,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:34,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:34,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019088569] [2025-03-04 00:07:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019088569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:07:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764860076] [2025-03-04 00:07:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:36,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:07:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:36,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:07:36,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:07:36,435 INFO L87 Difference]: Start difference. First operand 1197 states and 2006 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:07:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:39,227 INFO L93 Difference]: Finished difference Result 7275 states and 12300 transitions. [2025-03-04 00:07:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:07:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 287 [2025-03-04 00:07:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:39,265 INFO L225 Difference]: With dead ends: 7275 [2025-03-04 00:07:39,265 INFO L226 Difference]: Without dead ends: 6433 [2025-03-04 00:07:39,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=457, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:07:39,274 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2099 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:39,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 2440 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 00:07:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2025-03-04 00:07:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 2903. [2025-03-04 00:07:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2456 states have (on average 1.619299674267101) internal successors, (3977), 2460 states have internal predecessors, (3977), 427 states have call successors, (427), 19 states have call predecessors, (427), 19 states have return successors, (427), 423 states have call predecessors, (427), 427 states have call successors, (427) [2025-03-04 00:07:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 4831 transitions. [2025-03-04 00:07:39,514 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 4831 transitions. Word has length 287 [2025-03-04 00:07:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:39,514 INFO L471 AbstractCegarLoop]: Abstraction has 2903 states and 4831 transitions. [2025-03-04 00:07:39,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:07:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 4831 transitions. [2025-03-04 00:07:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:39,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:39,519 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:39,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:07:39,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:39,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1863051758, now seen corresponding path program 1 times [2025-03-04 00:07:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480421779] [2025-03-04 00:07:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:39,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:39,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:39,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:39,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480421779] [2025-03-04 00:07:41,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480421779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:41,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:41,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:07:41,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033723427] [2025-03-04 00:07:41,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:41,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:07:41,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:41,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:07:41,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:07:41,890 INFO L87 Difference]: Start difference. First operand 2903 states and 4831 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:07:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:44,768 INFO L93 Difference]: Finished difference Result 8024 states and 13430 transitions. [2025-03-04 00:07:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:07:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 287 [2025-03-04 00:07:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:44,798 INFO L225 Difference]: With dead ends: 8024 [2025-03-04 00:07:44,798 INFO L226 Difference]: Without dead ends: 5700 [2025-03-04 00:07:44,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:07:44,805 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1921 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:44,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 2678 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 00:07:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-03-04 00:07:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 2991. [2025-03-04 00:07:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2474 states have (on average 1.6034761519805982) internal successors, (3967), 2478 states have internal predecessors, (3967), 493 states have call successors, (493), 23 states have call predecessors, (493), 23 states have return successors, (493), 489 states have call predecessors, (493), 493 states have call successors, (493) [2025-03-04 00:07:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4953 transitions. [2025-03-04 00:07:45,010 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 4953 transitions. Word has length 287 [2025-03-04 00:07:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:45,011 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 4953 transitions. [2025-03-04 00:07:45,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:07:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4953 transitions. [2025-03-04 00:07:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:45,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:45,014 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:45,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:07:45,014 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:45,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1031093775, now seen corresponding path program 1 times [2025-03-04 00:07:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991186153] [2025-03-04 00:07:45,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:45,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:45,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:45,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:45,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991186153] [2025-03-04 00:07:46,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991186153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:46,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:07:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439500135] [2025-03-04 00:07:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:46,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:07:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:46,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:07:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:07:46,458 INFO L87 Difference]: Start difference. First operand 2991 states and 4953 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:47,400 INFO L93 Difference]: Finished difference Result 5157 states and 8579 transitions. [2025-03-04 00:07:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:07:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 287 [2025-03-04 00:07:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:47,426 INFO L225 Difference]: With dead ends: 5157 [2025-03-04 00:07:47,426 INFO L226 Difference]: Without dead ends: 4195 [2025-03-04 00:07:47,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:07:47,430 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 477 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:47,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1069 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:07:47,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2025-03-04 00:07:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 3424. [2025-03-04 00:07:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 2907 states have (on average 1.6181630546955625) internal successors, (4704), 2911 states have internal predecessors, (4704), 493 states have call successors, (493), 23 states have call predecessors, (493), 23 states have return successors, (493), 489 states have call predecessors, (493), 493 states have call successors, (493) [2025-03-04 00:07:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 5690 transitions. [2025-03-04 00:07:47,735 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 5690 transitions. Word has length 287 [2025-03-04 00:07:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:47,735 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 5690 transitions. [2025-03-04 00:07:47,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 5690 transitions. [2025-03-04 00:07:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 00:07:47,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:47,742 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:47,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:07:47,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1536652400, now seen corresponding path program 1 times [2025-03-04 00:07:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872268478] [2025-03-04 00:07:47,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:47,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:48,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:48,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:48,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 3 proven. 123 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:07:48,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:48,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872268478] [2025-03-04 00:07:48,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872268478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:48,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102802866] [2025-03-04 00:07:48,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:48,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:48,539 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-04 00:07:48,542 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-04 00:07:48,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 00:07:48,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 00:07:48,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:48,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:48,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:07:48,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2593 proven. 138 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2025-03-04 00:07:49,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 108 proven. 141 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2025-03-04 00:07:50,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102802866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:50,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:50,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 9] total 21 [2025-03-04 00:07:50,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326276722] [2025-03-04 00:07:50,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:50,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 00:07:50,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:50,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 00:07:50,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:07:50,251 INFO L87 Difference]: Start difference. First operand 3424 states and 5690 transitions. Second operand has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 9 states have call successors, (127), 5 states have call predecessors, (127), 10 states have return successors, (128), 9 states have call predecessors, (128), 9 states have call successors, (128) [2025-03-04 00:07:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:51,762 INFO L93 Difference]: Finished difference Result 5945 states and 9584 transitions. [2025-03-04 00:07:51,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 00:07:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 9 states have call successors, (127), 5 states have call predecessors, (127), 10 states have return successors, (128), 9 states have call predecessors, (128), 9 states have call successors, (128) Word has length 287 [2025-03-04 00:07:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:51,773 INFO L225 Difference]: With dead ends: 5945 [2025-03-04 00:07:51,773 INFO L226 Difference]: Without dead ends: 2690 [2025-03-04 00:07:51,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=764, Invalid=2428, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 00:07:51,779 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1294 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:51,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1275 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:07:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2025-03-04 00:07:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2058. [2025-03-04 00:07:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 1598 states have (on average 1.4831038798498122) internal successors, (2370), 1602 states have internal predecessors, (2370), 407 states have call successors, (407), 52 states have call predecessors, (407), 52 states have return successors, (407), 403 states have call predecessors, (407), 407 states have call successors, (407) [2025-03-04 00:07:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3184 transitions. [2025-03-04 00:07:52,053 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3184 transitions. Word has length 287 [2025-03-04 00:07:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 2058 states and 3184 transitions. [2025-03-04 00:07:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 9 states have call successors, (127), 5 states have call predecessors, (127), 10 states have return successors, (128), 9 states have call predecessors, (128), 9 states have call successors, (128) [2025-03-04 00:07:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3184 transitions. [2025-03-04 00:07:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-04 00:07:52,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:52,060 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:52,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:52,260 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,SelfDestructingSolverStorable11 [2025-03-04 00:07:52,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:52,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash -933104772, now seen corresponding path program 1 times [2025-03-04 00:07:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443188001] [2025-03-04 00:07:52,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:52,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-04 00:07:52,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-04 00:07:52,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:52,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443188001] [2025-03-04 00:07:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443188001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083363774] [2025-03-04 00:07:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:52,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:52,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:52,481 INFO L87 Difference]: Start difference. First operand 2058 states and 3184 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:52,801 INFO L93 Difference]: Finished difference Result 2782 states and 4315 transitions. [2025-03-04 00:07:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:52,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 291 [2025-03-04 00:07:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:52,814 INFO L225 Difference]: With dead ends: 2782 [2025-03-04 00:07:52,814 INFO L226 Difference]: Without dead ends: 2392 [2025-03-04 00:07:52,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-04 00:07:52,816 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 147 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:52,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 537 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-04 00:07:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2390. [2025-03-04 00:07:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 1834 states have (on average 1.4721919302071973) internal successors, (2700), 1838 states have internal predecessors, (2700), 493 states have call successors, (493), 62 states have call predecessors, (493), 62 states have return successors, (493), 489 states have call predecessors, (493), 493 states have call successors, (493) [2025-03-04 00:07:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3686 transitions. [2025-03-04 00:07:53,124 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3686 transitions. Word has length 291 [2025-03-04 00:07:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:53,125 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3686 transitions. [2025-03-04 00:07:53,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3686 transitions. [2025-03-04 00:07:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-04 00:07:53,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:53,128 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:07:53,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -395095016, now seen corresponding path program 1 times [2025-03-04 00:07:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259986167] [2025-03-04 00:07:53,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-04 00:07:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-04 00:07:53,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:53,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:53,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259986167] [2025-03-04 00:07:53,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259986167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:53,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:53,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943406916] [2025-03-04 00:07:53,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:53,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:53,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:53,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:53,269 INFO L87 Difference]: Start difference. First operand 2390 states and 3686 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:53,621 INFO L93 Difference]: Finished difference Result 6368 states and 9856 transitions. [2025-03-04 00:07:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 293 [2025-03-04 00:07:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:53,648 INFO L225 Difference]: With dead ends: 6368 [2025-03-04 00:07:53,648 INFO L226 Difference]: Without dead ends: 4358 [2025-03-04 00:07:53,655 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-04 00:07:53,656 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 208 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:53,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 587 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4358 states. [2025-03-04 00:07:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4358 to 3146. [2025-03-04 00:07:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 2590 states have (on average 1.5343629343629344) internal successors, (3974), 2594 states have internal predecessors, (3974), 493 states have call successors, (493), 62 states have call predecessors, (493), 62 states have return successors, (493), 489 states have call predecessors, (493), 493 states have call successors, (493) [2025-03-04 00:07:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4960 transitions. [2025-03-04 00:07:53,950 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4960 transitions. Word has length 293 [2025-03-04 00:07:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:53,953 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4960 transitions. [2025-03-04 00:07:53,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4960 transitions. [2025-03-04 00:07:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-04 00:07:53,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:53,957 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:53,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:07:53,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:53,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:53,957 INFO L85 PathProgramCache]: Analyzing trace with hash 722188905, now seen corresponding path program 1 times [2025-03-04 00:07:53,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:53,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149608665] [2025-03-04 00:07:53,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-04 00:07:54,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 00:07:54,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:54,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149608665] [2025-03-04 00:07:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149608665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662864113] [2025-03-04 00:07:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:54,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:54,524 INFO L87 Difference]: Start difference. First operand 3146 states and 4960 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:54,836 INFO L93 Difference]: Finished difference Result 5954 states and 9401 transitions. [2025-03-04 00:07:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 294 [2025-03-04 00:07:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:54,847 INFO L225 Difference]: With dead ends: 5954 [2025-03-04 00:07:54,847 INFO L226 Difference]: Without dead ends: 3146 [2025-03-04 00:07:54,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:54,852 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 94 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:54,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 588 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2025-03-04 00:07:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3146. [2025-03-04 00:07:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 2590 states have (on average 1.5158301158301157) internal successors, (3926), 2594 states have internal predecessors, (3926), 493 states have call successors, (493), 62 states have call predecessors, (493), 62 states have return successors, (493), 489 states have call predecessors, (493), 493 states have call successors, (493) [2025-03-04 00:07:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4912 transitions. [2025-03-04 00:07:55,056 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4912 transitions. Word has length 294 [2025-03-04 00:07:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:55,056 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4912 transitions. [2025-03-04 00:07:55,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4912 transitions. [2025-03-04 00:07:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:07:55,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:55,059 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:55,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:07:55,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash 208937343, now seen corresponding path program 1 times [2025-03-04 00:07:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000413235] [2025-03-04 00:07:55,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:55,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:07:55,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:07:55,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:55,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000413235] [2025-03-04 00:07:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000413235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40372973] [2025-03-04 00:07:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:55,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:55,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:55,503 INFO L87 Difference]: Start difference. First operand 3146 states and 4912 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:55,915 INFO L93 Difference]: Finished difference Result 8914 states and 14032 transitions. [2025-03-04 00:07:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:07:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 295 [2025-03-04 00:07:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:55,935 INFO L225 Difference]: With dead ends: 8914 [2025-03-04 00:07:55,935 INFO L226 Difference]: Without dead ends: 6106 [2025-03-04 00:07:55,942 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-04 00:07:55,942 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 234 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:55,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 676 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2025-03-04 00:07:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 5748. [2025-03-04 00:07:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 5096 states have (on average 1.5472919937205651) internal successors, (7885), 5112 states have internal predecessors, (7885), 565 states have call successors, (565), 86 states have call predecessors, (565), 86 states have return successors, (565), 549 states have call predecessors, (565), 565 states have call successors, (565) [2025-03-04 00:07:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 9015 transitions. [2025-03-04 00:07:56,397 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 9015 transitions. Word has length 295 [2025-03-04 00:07:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:56,400 INFO L471 AbstractCegarLoop]: Abstraction has 5748 states and 9015 transitions. [2025-03-04 00:07:56,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:07:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 9015 transitions. [2025-03-04 00:07:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:07:56,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:56,412 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:56,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:07:56,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash 420288256, now seen corresponding path program 1 times [2025-03-04 00:07:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058544607] [2025-03-04 00:07:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:07:56,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:07:56,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:56,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:07:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058544607] [2025-03-04 00:07:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058544607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:07:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629483391] [2025-03-04 00:07:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:57,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:07:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:07:57,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:07:57,771 INFO L87 Difference]: Start difference. First operand 5748 states and 9015 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:08:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:00,329 INFO L93 Difference]: Finished difference Result 17052 states and 26015 transitions. [2025-03-04 00:08:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:08:00,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 295 [2025-03-04 00:08:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:00,381 INFO L225 Difference]: With dead ends: 17052 [2025-03-04 00:08:00,381 INFO L226 Difference]: Without dead ends: 12492 [2025-03-04 00:08:00,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:08:00,398 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 687 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:00,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1036 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:08:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2025-03-04 00:08:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 5988. [2025-03-04 00:08:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5988 states, 5336 states have (on average 1.5226761619190405) internal successors, (8125), 5352 states have internal predecessors, (8125), 565 states have call successors, (565), 86 states have call predecessors, (565), 86 states have return successors, (565), 549 states have call predecessors, (565), 565 states have call successors, (565) [2025-03-04 00:08:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5988 states to 5988 states and 9255 transitions. [2025-03-04 00:08:01,164 INFO L78 Accepts]: Start accepts. Automaton has 5988 states and 9255 transitions. Word has length 295 [2025-03-04 00:08:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:01,171 INFO L471 AbstractCegarLoop]: Abstraction has 5988 states and 9255 transitions. [2025-03-04 00:08:01,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:08:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5988 states and 9255 transitions. [2025-03-04 00:08:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:08:01,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:01,181 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:08:01,181 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:01,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:01,181 INFO L85 PathProgramCache]: Analyzing trace with hash -576784097, now seen corresponding path program 1 times [2025-03-04 00:08:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794851909] [2025-03-04 00:08:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:01,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:01,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:01,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:01,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 9 proven. 117 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:08:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794851909] [2025-03-04 00:08:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794851909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843928828] [2025-03-04 00:08:01,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:01,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:01,793 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-04 00:08:01,795 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-04 00:08:01,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:01,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:01,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:01,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:01,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:08:01,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 516 proven. 117 refuted. 0 times theorem prover too weak. 2979 trivial. 0 not checked. [2025-03-04 00:08:02,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 9 proven. 117 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:08:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843928828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:08:02,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:08:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:08:02,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648774409] [2025-03-04 00:08:02,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:02,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:08:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:02,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:08:02,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:08:02,552 INFO L87 Difference]: Start difference. First operand 5988 states and 9255 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (82), 2 states have call predecessors, (82), 4 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83) [2025-03-04 00:08:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:03,252 INFO L93 Difference]: Finished difference Result 12038 states and 18471 transitions. [2025-03-04 00:08:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:08:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (82), 2 states have call predecessors, (82), 4 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83) Word has length 295 [2025-03-04 00:08:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:03,274 INFO L225 Difference]: With dead ends: 12038 [2025-03-04 00:08:03,274 INFO L226 Difference]: Without dead ends: 6210 [2025-03-04 00:08:03,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 587 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:08:03,286 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 230 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:03,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 469 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:08:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6210 states. [2025-03-04 00:08:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6210 to 6088. [2025-03-04 00:08:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6088 states, 5411 states have (on average 1.5095176492330438) internal successors, (8168), 5427 states have internal predecessors, (8168), 565 states have call successors, (565), 111 states have call predecessors, (565), 111 states have return successors, (565), 549 states have call predecessors, (565), 565 states have call successors, (565) [2025-03-04 00:08:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 9298 transitions. [2025-03-04 00:08:03,969 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 9298 transitions. Word has length 295 [2025-03-04 00:08:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:03,969 INFO L471 AbstractCegarLoop]: Abstraction has 6088 states and 9298 transitions. [2025-03-04 00:08:03,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (82), 2 states have call predecessors, (82), 4 states have return successors, (83), 2 states have call predecessors, (83), 2 states have call successors, (83) [2025-03-04 00:08:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 9298 transitions. [2025-03-04 00:08:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:08:03,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:03,974 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:03,988 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-04 00:08:04,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 00:08:04,174 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:04,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1148696800, now seen corresponding path program 1 times [2025-03-04 00:08:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499463416] [2025-03-04 00:08:04,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:04,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:04,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:04,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:04,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:08:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:05,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499463416] [2025-03-04 00:08:05,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499463416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:05,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453265850] [2025-03-04 00:08:05,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:05,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:05,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:05,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:08:05,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:08:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:05,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:05,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:05,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:05,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:08:05,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-03-04 00:08:05,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:08:05,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453265850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:08:05,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:08:05,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:08:05,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958517646] [2025-03-04 00:08:05,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:05,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:08:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:05,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:08:05,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:08:05,804 INFO L87 Difference]: Start difference. First operand 6088 states and 9298 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-04 00:08:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:06,422 INFO L93 Difference]: Finished difference Result 8530 states and 12938 transitions. [2025-03-04 00:08:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:08:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 295 [2025-03-04 00:08:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:06,434 INFO L225 Difference]: With dead ends: 8530 [2025-03-04 00:08:06,434 INFO L226 Difference]: Without dead ends: 3420 [2025-03-04 00:08:06,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 587 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:08:06,441 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 124 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:06,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 468 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:08:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2025-03-04 00:08:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3346. [2025-03-04 00:08:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2764 states have (on average 1.47178002894356) internal successors, (4068), 2768 states have internal predecessors, (4068), 493 states have call successors, (493), 88 states have call predecessors, (493), 88 states have return successors, (493), 489 states have call predecessors, (493), 493 states have call successors, (493) [2025-03-04 00:08:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5054 transitions. [2025-03-04 00:08:06,860 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5054 transitions. Word has length 295 [2025-03-04 00:08:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:06,861 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5054 transitions. [2025-03-04 00:08:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (79), 2 states have call predecessors, (79), 4 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-04 00:08:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5054 transitions. [2025-03-04 00:08:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:08:06,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:06,863 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:06,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:08:07,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:07,067 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:07,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1724817410, now seen corresponding path program 1 times [2025-03-04 00:08:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:07,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044397162] [2025-03-04 00:08:07,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:07,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:07,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:07,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:07,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:08:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:08,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044397162] [2025-03-04 00:08:08,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044397162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:08,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174075475] [2025-03-04 00:08:08,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:08,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:08,827 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:08:08,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:08:08,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:09,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:09,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:09,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:09,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 00:08:09,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1922 proven. 255 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2025-03-04 00:08:10,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174075475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:14,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:08:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2025-03-04 00:08:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462494751] [2025-03-04 00:08:14,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:14,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 00:08:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:14,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 00:08:14,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:08:14,714 INFO L87 Difference]: Start difference. First operand 3346 states and 5054 transitions. Second operand has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 7 states have call predecessors, (86), 8 states have call successors, (86) [2025-03-04 00:08:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:17,809 INFO L93 Difference]: Finished difference Result 9176 states and 13784 transitions. [2025-03-04 00:08:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 00:08:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 7 states have call predecessors, (86), 8 states have call successors, (86) Word has length 295 [2025-03-04 00:08:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:17,829 INFO L225 Difference]: With dead ends: 9176 [2025-03-04 00:08:17,830 INFO L226 Difference]: Without dead ends: 6229 [2025-03-04 00:08:17,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1248, Invalid=4452, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 00:08:17,842 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 2690 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2700 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:17,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2700 Valid, 2672 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:08:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2025-03-04 00:08:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 5251. [2025-03-04 00:08:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 4471 states have (on average 1.4802057705211362) internal successors, (6618), 4481 states have internal predecessors, (6618), 639 states have call successors, (639), 140 states have call predecessors, (639), 140 states have return successors, (639), 629 states have call predecessors, (639), 639 states have call successors, (639) [2025-03-04 00:08:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 7896 transitions. [2025-03-04 00:08:18,453 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 7896 transitions. Word has length 295 [2025-03-04 00:08:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 5251 states and 7896 transitions. [2025-03-04 00:08:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 8 states have call successors, (86), 5 states have call predecessors, (86), 8 states have return successors, (86), 7 states have call predecessors, (86), 8 states have call successors, (86) [2025-03-04 00:08:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 7896 transitions. [2025-03-04 00:08:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:08:18,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:18,458 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:08:18,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:08:18,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:18,659 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:18,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1732576769, now seen corresponding path program 1 times [2025-03-04 00:08:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601559084] [2025-03-04 00:08:18,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:18,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:19,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:19,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:19,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:08:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843863996] [2025-03-04 00:08:19,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:19,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:19,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:08:19,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:08:19,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:08:19,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:08:19,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:19,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:19,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 00:08:19,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1376 proven. 186 refuted. 0 times theorem prover too weak. 2050 trivial. 0 not checked. [2025-03-04 00:08:20,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 60 proven. 189 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2025-03-04 00:08:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601559084] [2025-03-04 00:08:22,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:08:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843863996] [2025-03-04 00:08:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843863996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:08:22,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:08:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2025-03-04 00:08:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560169463] [2025-03-04 00:08:22,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:22,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:08:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:22,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:08:22,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:08:22,371 INFO L87 Difference]: Start difference. First operand 5251 states and 7896 transitions. Second operand has 20 states, 19 states have (on average 7.368421052631579) internal successors, (140), 18 states have internal predecessors, (140), 6 states have call successors, (86), 4 states have call predecessors, (86), 7 states have return successors, (86), 6 states have call predecessors, (86), 6 states have call successors, (86)