./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.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_amount500_file-74.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 12c4232328ebed2959d46283ec7c985dd6c5525d615e314238386424a59fd52d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:36:02,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:36:02,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:36:02,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:36:02,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:36:02,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:36:02,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:36:02,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:36:02,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:36:02,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:36:02,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:36:02,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:36:02,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:36:02,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:36:02,871 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:36:02,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:36:02,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:36:02,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:36:02,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:36:02,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:36:02,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:36:02,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:36:02,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:02,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:36:02,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:36:02,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:36:02,874 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 -> 12c4232328ebed2959d46283ec7c985dd6c5525d615e314238386424a59fd52d [2025-03-04 00:36:03,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:36:03,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:36:03,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:36:03,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:36:03,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:36:03,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i [2025-03-04 00:36:04,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057434f9d/99f0cccd8e784539bb6356497cfd0951/FLAGe50b6c0e9 [2025-03-04 00:36:04,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:36:04,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i [2025-03-04 00:36:04,488 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057434f9d/99f0cccd8e784539bb6356497cfd0951/FLAGe50b6c0e9 [2025-03-04 00:36:04,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/057434f9d/99f0cccd8e784539bb6356497cfd0951 [2025-03-04 00:36:04,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:36:04,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:36:04,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:04,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:36:04,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:36:04,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:04" (1/1) ... [2025-03-04 00:36:04,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d754e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:04, skipping insertion in model container [2025-03-04 00:36:04,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:04" (1/1) ... [2025-03-04 00:36:04,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:36:04,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i[916,929] [2025-03-04 00:36:05,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:05,084 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:36:05,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i[916,929] [2025-03-04 00:36:05,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:05,192 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:36:05,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05 WrapperNode [2025-03-04 00:36:05,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:05,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:05,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:36:05,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:36:05,198 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:36:05" (1/1) ... [2025-03-04 00:36:05,218 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:36:05" (1/1) ... [2025-03-04 00:36:05,313 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 718 [2025-03-04 00:36:05,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:05,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:36:05,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:36:05,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:36:05,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,438 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:36:05,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:36:05,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:36:05,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:36:05,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:36:05,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (1/1) ... [2025-03-04 00:36:05,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:05,540 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:36:05,545 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:36:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:36:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:36:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:36:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:36:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:36:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:36:05,681 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:36:05,682 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:36:06,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short57#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~bitwise61#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~ite66#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short67#1; [2025-03-04 00:36:06,659 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-04 00:36:06,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:36:06,691 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:36:06,692 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:36:06,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:06 BoogieIcfgContainer [2025-03-04 00:36:06,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:36:06,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:36:06,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:36:06,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:36:06,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:04" (1/3) ... [2025-03-04 00:36:06,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215df11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:06, skipping insertion in model container [2025-03-04 00:36:06,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:05" (2/3) ... [2025-03-04 00:36:06,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215df11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:06, skipping insertion in model container [2025-03-04 00:36:06,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:06" (3/3) ... [2025-03-04 00:36:06,703 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-74.i [2025-03-04 00:36:06,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:36:06,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-74.i that has 2 procedures, 292 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:36:06,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:36:06,776 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;@4e542253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:36:06,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:36:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 216 states have (on average 1.537037037037037) internal successors, (332), 217 states have internal predecessors, (332), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 00:36:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:06,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:06,804 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:06,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 155238656, now seen corresponding path program 1 times [2025-03-04 00:36:06,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:06,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760150406] [2025-03-04 00:36:06,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:06,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:06,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:07,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760150406] [2025-03-04 00:36:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760150406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632761453] [2025-03-04 00:36:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:07,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:07,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:07,667 INFO L87 Difference]: Start difference. First operand has 292 states, 216 states have (on average 1.537037037037037) internal successors, (332), 217 states have internal predecessors, (332), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:07,953 INFO L93 Difference]: Finished difference Result 777 states and 1387 transitions. [2025-03-04 00:36:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:07,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:07,966 INFO L225 Difference]: With dead ends: 777 [2025-03-04 00:36:07,967 INFO L226 Difference]: Without dead ends: 488 [2025-03-04 00:36:07,974 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:36:07,976 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 314 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:07,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:36:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-04 00:36:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 485. [2025-03-04 00:36:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 373 states have (on average 1.5281501340482573) internal successors, (570), 374 states have internal predecessors, (570), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-04 00:36:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 788 transitions. [2025-03-04 00:36:08,089 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 788 transitions. Word has length 496 [2025-03-04 00:36:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:08,092 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 788 transitions. [2025-03-04 00:36:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 788 transitions. [2025-03-04 00:36:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:08,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:08,103 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:36:08,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -328436671, now seen corresponding path program 1 times [2025-03-04 00:36:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764665019] [2025-03-04 00:36:08,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:08,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:08,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:08,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:08,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764665019] [2025-03-04 00:36:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764665019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:08,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981902512] [2025-03-04 00:36:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:08,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:08,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:08,506 INFO L87 Difference]: Start difference. First operand 485 states and 788 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:08,653 INFO L93 Difference]: Finished difference Result 1335 states and 2173 transitions. [2025-03-04 00:36:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:08,666 INFO L225 Difference]: With dead ends: 1335 [2025-03-04 00:36:08,667 INFO L226 Difference]: Without dead ends: 853 [2025-03-04 00:36:08,668 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:36:08,669 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 306 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:08,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:36:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-04 00:36:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2025-03-04 00:36:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 685 states have (on average 1.5489051094890511) internal successors, (1061), 688 states have internal predecessors, (1061), 159 states have call successors, (159), 4 states have call predecessors, (159), 4 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-04 00:36:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1379 transitions. [2025-03-04 00:36:08,744 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1379 transitions. Word has length 496 [2025-03-04 00:36:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1379 transitions. [2025-03-04 00:36:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1379 transitions. [2025-03-04 00:36:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:08,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:08,751 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:36:08,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:08,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -936513534, now seen corresponding path program 1 times [2025-03-04 00:36:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:08,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68019927] [2025-03-04 00:36:08,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:08,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:08,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:08,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:08,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68019927] [2025-03-04 00:36:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68019927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:09,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:09,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529353582] [2025-03-04 00:36:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:09,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:09,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:09,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:09,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:09,656 INFO L87 Difference]: Start difference. First operand 849 states and 1379 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:09,967 INFO L93 Difference]: Finished difference Result 2392 states and 3899 transitions. [2025-03-04 00:36:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:09,975 INFO L225 Difference]: With dead ends: 2392 [2025-03-04 00:36:09,976 INFO L226 Difference]: Without dead ends: 1546 [2025-03-04 00:36:09,981 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:36:09,983 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 512 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:09,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1358 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:36:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-04 00:36:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 982. [2025-03-04 00:36:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 744 states have (on average 1.5134408602150538) internal successors, (1126), 747 states have internal predecessors, (1126), 232 states have call successors, (232), 5 states have call predecessors, (232), 5 states have return successors, (232), 229 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-04 00:36:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1590 transitions. [2025-03-04 00:36:10,102 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1590 transitions. Word has length 496 [2025-03-04 00:36:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:10,103 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1590 transitions. [2025-03-04 00:36:10,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1590 transitions. [2025-03-04 00:36:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:10,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:10,111 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:36:10,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:10,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:10,112 INFO L85 PathProgramCache]: Analyzing trace with hash 172301665, now seen corresponding path program 1 times [2025-03-04 00:36:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386930692] [2025-03-04 00:36:10,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:10,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:10,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:11,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386930692] [2025-03-04 00:36:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386930692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:11,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:11,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:36:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669200412] [2025-03-04 00:36:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:11,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:36:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:11,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:36:11,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:11,886 INFO L87 Difference]: Start difference. First operand 982 states and 1590 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:12,333 INFO L93 Difference]: Finished difference Result 2026 states and 3248 transitions. [2025-03-04 00:36:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:36:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:12,342 INFO L225 Difference]: With dead ends: 2026 [2025-03-04 00:36:12,343 INFO L226 Difference]: Without dead ends: 1180 [2025-03-04 00:36:12,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:12,347 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 379 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:12,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1445 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:36:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-04 00:36:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1016. [2025-03-04 00:36:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 782 states have (on average 1.5038363171355498) internal successors, (1176), 785 states have internal predecessors, (1176), 224 states have call successors, (224), 9 states have call predecessors, (224), 9 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-04 00:36:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1624 transitions. [2025-03-04 00:36:12,438 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1624 transitions. Word has length 496 [2025-03-04 00:36:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1624 transitions. [2025-03-04 00:36:12,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1624 transitions. [2025-03-04 00:36:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:12,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:12,446 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:36:12,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1865754624, now seen corresponding path program 1 times [2025-03-04 00:36:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757840711] [2025-03-04 00:36:12,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:12,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:12,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:12,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757840711] [2025-03-04 00:36:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757840711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:13,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065188965] [2025-03-04 00:36:13,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:13,608 INFO L87 Difference]: Start difference. First operand 1016 states and 1624 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:14,324 INFO L93 Difference]: Finished difference Result 3094 states and 4954 transitions. [2025-03-04 00:36:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:14,340 INFO L225 Difference]: With dead ends: 3094 [2025-03-04 00:36:14,340 INFO L226 Difference]: Without dead ends: 2222 [2025-03-04 00:36:14,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:14,345 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1064 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:14,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 1355 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:36:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-04 00:36:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2191. [2025-03-04 00:36:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 1748 states have (on average 1.509725400457666) internal successors, (2639), 1757 states have internal predecessors, (2639), 423 states have call successors, (423), 19 states have call predecessors, (423), 19 states have return successors, (423), 414 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-04 00:36:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 3485 transitions. [2025-03-04 00:36:14,531 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 3485 transitions. Word has length 496 [2025-03-04 00:36:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:14,532 INFO L471 AbstractCegarLoop]: Abstraction has 2191 states and 3485 transitions. [2025-03-04 00:36:14,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 3485 transitions. [2025-03-04 00:36:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:14,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:14,541 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:36:14,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:14,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash -50217887, now seen corresponding path program 1 times [2025-03-04 00:36:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972115116] [2025-03-04 00:36:14,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:14,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:14,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:14,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972115116] [2025-03-04 00:36:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972115116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:36:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067620449] [2025-03-04 00:36:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:36:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:15,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:36:15,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:15,686 INFO L87 Difference]: Start difference. First operand 2191 states and 3485 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:16,568 INFO L93 Difference]: Finished difference Result 6490 states and 10314 transitions. [2025-03-04 00:36:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:36:16,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:16,597 INFO L225 Difference]: With dead ends: 6490 [2025-03-04 00:36:16,597 INFO L226 Difference]: Without dead ends: 4034 [2025-03-04 00:36:16,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:16,607 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1078 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:16,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1401 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:36:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2025-03-04 00:36:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 2242. [2025-03-04 00:36:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1799 states have (on average 1.5063924402445803) internal successors, (2710), 1808 states have internal predecessors, (2710), 423 states have call successors, (423), 19 states have call predecessors, (423), 19 states have return successors, (423), 414 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-04 00:36:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3556 transitions. [2025-03-04 00:36:16,805 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3556 transitions. Word has length 496 [2025-03-04 00:36:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:16,807 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3556 transitions. [2025-03-04 00:36:16,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3556 transitions. [2025-03-04 00:36:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:16,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:16,816 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:36:16,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1861371009, now seen corresponding path program 1 times [2025-03-04 00:36:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353615624] [2025-03-04 00:36:16,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:16,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:17,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:17,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:17,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353615624] [2025-03-04 00:36:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353615624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:17,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446723543] [2025-03-04 00:36:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:17,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:17,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:17,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:17,946 INFO L87 Difference]: Start difference. First operand 2242 states and 3556 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:18,733 INFO L93 Difference]: Finished difference Result 5654 states and 8844 transitions. [2025-03-04 00:36:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:18,752 INFO L225 Difference]: With dead ends: 5654 [2025-03-04 00:36:18,752 INFO L226 Difference]: Without dead ends: 3556 [2025-03-04 00:36:18,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:18,759 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 441 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:18,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1444 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:36:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2025-03-04 00:36:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 2262. [2025-03-04 00:36:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 1819 states have (on average 1.5035733919736118) internal successors, (2735), 1828 states have internal predecessors, (2735), 423 states have call successors, (423), 19 states have call predecessors, (423), 19 states have return successors, (423), 414 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-04 00:36:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 3581 transitions. [2025-03-04 00:36:18,944 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 3581 transitions. Word has length 496 [2025-03-04 00:36:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:18,944 INFO L471 AbstractCegarLoop]: Abstraction has 2262 states and 3581 transitions. [2025-03-04 00:36:18,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 3581 transitions. [2025-03-04 00:36:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:18,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:18,949 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:18,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:36:18,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:18,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2072721922, now seen corresponding path program 1 times [2025-03-04 00:36:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:18,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975309743] [2025-03-04 00:36:18,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:18,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:19,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:19,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:19,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975309743] [2025-03-04 00:36:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975309743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:36:20,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936583884] [2025-03-04 00:36:20,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:20,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:36:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:20,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:36:20,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:36:20,679 INFO L87 Difference]: Start difference. First operand 2262 states and 3581 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:21,321 INFO L93 Difference]: Finished difference Result 7235 states and 11396 transitions. [2025-03-04 00:36:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:36:21,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-04 00:36:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:21,345 INFO L225 Difference]: With dead ends: 7235 [2025-03-04 00:36:21,345 INFO L226 Difference]: Without dead ends: 5117 [2025-03-04 00:36:21,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:36:21,355 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 496 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:21,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2619 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:36:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2025-03-04 00:36:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 5093. [2025-03-04 00:36:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5093 states, 4458 states have (on average 1.5336473755047106) internal successors, (6837), 4487 states have internal predecessors, (6837), 583 states have call successors, (583), 51 states have call predecessors, (583), 51 states have return successors, (583), 554 states have call predecessors, (583), 583 states have call successors, (583) [2025-03-04 00:36:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5093 states to 5093 states and 8003 transitions. [2025-03-04 00:36:21,617 INFO L78 Accepts]: Start accepts. Automaton has 5093 states and 8003 transitions. Word has length 496 [2025-03-04 00:36:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:21,618 INFO L471 AbstractCegarLoop]: Abstraction has 5093 states and 8003 transitions. [2025-03-04 00:36:21,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:36:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5093 states and 8003 transitions. [2025-03-04 00:36:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:21,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:21,630 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:36:21,630 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:21,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1453075359, now seen corresponding path program 1 times [2025-03-04 00:36:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972023262] [2025-03-04 00:36:21,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:21,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:21,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:21,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:36:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972023262] [2025-03-04 00:36:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972023262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:36:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558379702] [2025-03-04 00:36:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:36:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:22,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:36:22,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:36:22,543 INFO L87 Difference]: Start difference. First operand 5093 states and 8003 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-04 00:36:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:23,374 INFO L93 Difference]: Finished difference Result 13597 states and 21426 transitions. [2025-03-04 00:36:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 496 [2025-03-04 00:36:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:23,439 INFO L225 Difference]: With dead ends: 13597 [2025-03-04 00:36:23,440 INFO L226 Difference]: Without dead ends: 8656 [2025-03-04 00:36:23,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:36:23,467 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 682 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:23,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1489 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:36:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2025-03-04 00:36:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8654. [2025-03-04 00:36:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8654 states, 7573 states have (on average 1.534662617192658) internal successors, (11622), 7621 states have internal predecessors, (11622), 1003 states have call successors, (1003), 77 states have call predecessors, (1003), 77 states have return successors, (1003), 955 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 00:36:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8654 states to 8654 states and 13628 transitions. [2025-03-04 00:36:24,055 INFO L78 Accepts]: Start accepts. Automaton has 8654 states and 13628 transitions. Word has length 496 [2025-03-04 00:36:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:24,056 INFO L471 AbstractCegarLoop]: Abstraction has 8654 states and 13628 transitions. [2025-03-04 00:36:24,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-04 00:36:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states and 13628 transitions. [2025-03-04 00:36:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-04 00:36:24,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:24,068 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:36:24,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 147188611, now seen corresponding path program 1 times [2025-03-04 00:36:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795012547] [2025-03-04 00:36:24,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:25,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:25,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:25,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:36:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795012547] [2025-03-04 00:36:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795012547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499607243] [2025-03-04 00:36:26,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:26,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:26,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:26,242 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:36:26,250 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:36:26,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-04 00:36:26,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-04 00:36:26,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:26,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:36:26,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4398 proven. 153 refuted. 0 times theorem prover too weak. 5961 trivial. 0 not checked. [2025-03-04 00:36:28,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:36:29,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499607243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:29,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-03-04 00:36:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931171428] [2025-03-04 00:36:29,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:29,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:36:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:29,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:36:29,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:36:29,452 INFO L87 Difference]: Start difference. First operand 8654 states and 13628 transitions. Second operand has 18 states, 18 states have (on average 18.72222222222222) internal successors, (337), 18 states have internal predecessors, (337), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-04 00:36:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:31,651 INFO L93 Difference]: Finished difference Result 21486 states and 32945 transitions. [2025-03-04 00:36:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 00:36:31,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 18.72222222222222) internal successors, (337), 18 states have internal predecessors, (337), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) Word has length 496 [2025-03-04 00:36:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:31,700 INFO L225 Difference]: With dead ends: 21486 [2025-03-04 00:36:31,700 INFO L226 Difference]: Without dead ends: 12981 [2025-03-04 00:36:31,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 979 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:36:31,718 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1491 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:31,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 2017 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:36:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2025-03-04 00:36:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 4392. [2025-03-04 00:36:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 3727 states have (on average 1.4998658438422323) internal successors, (5590), 3743 states have internal predecessors, (5590), 601 states have call successors, (601), 63 states have call predecessors, (601), 63 states have return successors, (601), 585 states have call predecessors, (601), 601 states have call successors, (601) [2025-03-04 00:36:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6792 transitions. [2025-03-04 00:36:32,267 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6792 transitions. Word has length 496 [2025-03-04 00:36:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:32,268 INFO L471 AbstractCegarLoop]: Abstraction has 4392 states and 6792 transitions. [2025-03-04 00:36:32,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.72222222222222) internal successors, (337), 18 states have internal predecessors, (337), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-04 00:36:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6792 transitions. [2025-03-04 00:36:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-04 00:36:32,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:32,276 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:32,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:36:32,480 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,SelfDestructingSolverStorable9 [2025-03-04 00:36:32,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash -148145168, now seen corresponding path program 1 times [2025-03-04 00:36:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457539678] [2025-03-04 00:36:32,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:32,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-04 00:36:33,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-04 00:36:33,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:33,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 159 proven. 57 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:36:34,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457539678] [2025-03-04 00:36:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457539678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607120037] [2025-03-04 00:36:34,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:34,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:34,053 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:36:34,055 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:36:34,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-04 00:36:34,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-04 00:36:34,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:34,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:34,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:36:34,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4206 proven. 57 refuted. 0 times theorem prover too weak. 6249 trivial. 0 not checked. [2025-03-04 00:36:34,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 159 proven. 57 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:36:34,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607120037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:34,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:34,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:36:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091783136] [2025-03-04 00:36:34,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:34,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:36:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:34,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:36:34,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:36:34,957 INFO L87 Difference]: Start difference. First operand 4392 states and 6792 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-03-04 00:36:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:35,892 INFO L93 Difference]: Finished difference Result 8728 states and 13449 transitions. [2025-03-04 00:36:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:36:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) Word has length 497 [2025-03-04 00:36:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:35,915 INFO L225 Difference]: With dead ends: 8728 [2025-03-04 00:36:35,915 INFO L226 Difference]: Without dead ends: 4502 [2025-03-04 00:36:35,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:36:35,928 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 915 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:35,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 961 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:36:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2025-03-04 00:36:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4412. [2025-03-04 00:36:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4412 states, 3742 states have (on average 1.4967931587386425) internal successors, (5601), 3758 states have internal predecessors, (5601), 601 states have call successors, (601), 68 states have call predecessors, (601), 68 states have return successors, (601), 585 states have call predecessors, (601), 601 states have call successors, (601) [2025-03-04 00:36:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 6803 transitions. [2025-03-04 00:36:36,372 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 6803 transitions. Word has length 497 [2025-03-04 00:36:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:36,373 INFO L471 AbstractCegarLoop]: Abstraction has 4412 states and 6803 transitions. [2025-03-04 00:36:36,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-03-04 00:36:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 6803 transitions. [2025-03-04 00:36:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-04 00:36:36,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:36,429 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:36:36,629 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,SelfDestructingSolverStorable10 [2025-03-04 00:36:36,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:36,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash 585888749, now seen corresponding path program 1 times [2025-03-04 00:36:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:36,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330623210] [2025-03-04 00:36:36,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:36,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-04 00:36:38,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-04 00:36:38,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:38,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:36:39,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330623210] [2025-03-04 00:36:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330623210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141196374] [2025-03-04 00:36:39,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:39,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:39,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:39,335 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:36:39,337 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:36:39,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-04 00:36:39,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-04 00:36:39,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:39,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:36:39,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4398 proven. 153 refuted. 0 times theorem prover too weak. 5961 trivial. 0 not checked. [2025-03-04 00:36:41,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:36:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141196374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:41,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2025-03-04 00:36:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345970619] [2025-03-04 00:36:41,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:41,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:36:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:41,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:36:41,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-04 00:36:41,968 INFO L87 Difference]: Start difference. First operand 4412 states and 6803 transitions. Second operand has 26 states, 26 states have (on average 13.5) internal successors, (351), 26 states have internal predecessors, (351), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-04 00:36:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:47,139 INFO L93 Difference]: Finished difference Result 18740 states and 27983 transitions. [2025-03-04 00:36:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-04 00:36:47,140 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.5) internal successors, (351), 26 states have internal predecessors, (351), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) Word has length 498 [2025-03-04 00:36:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:47,186 INFO L225 Difference]: With dead ends: 18740 [2025-03-04 00:36:47,186 INFO L226 Difference]: Without dead ends: 14498 [2025-03-04 00:36:47,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 992 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2835 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1636, Invalid=7106, Unknown=0, NotChecked=0, Total=8742 [2025-03-04 00:36:47,201 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 6643 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 1825 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6817 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 4508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1825 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:47,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6817 Valid, 3884 Invalid, 4508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1825 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 00:36:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2025-03-04 00:36:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 7786. [2025-03-04 00:36:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7786 states, 6767 states have (on average 1.5000738879858135) internal successors, (10151), 6803 states have internal predecessors, (10151), 893 states have call successors, (893), 125 states have call predecessors, (893), 125 states have return successors, (893), 857 states have call predecessors, (893), 893 states have call successors, (893) [2025-03-04 00:36:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7786 states to 7786 states and 11937 transitions. [2025-03-04 00:36:47,898 INFO L78 Accepts]: Start accepts. Automaton has 7786 states and 11937 transitions. Word has length 498 [2025-03-04 00:36:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:47,899 INFO L471 AbstractCegarLoop]: Abstraction has 7786 states and 11937 transitions. [2025-03-04 00:36:47,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.5) internal successors, (351), 26 states have internal predecessors, (351), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-04 00:36:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 7786 states and 11937 transitions. [2025-03-04 00:36:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-04 00:36:47,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:47,909 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,923 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:36:48,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:48,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1939198446, now seen corresponding path program 1 times [2025-03-04 00:36:48,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:48,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785469875] [2025-03-04 00:36:48,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:48,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:48,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-04 00:36:49,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-04 00:36:49,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:49,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 312 proven. 318 refuted. 0 times theorem prover too weak. 9882 trivial. 0 not checked. [2025-03-04 00:36:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785469875] [2025-03-04 00:36:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785469875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006702428] [2025-03-04 00:36:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:51,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:51,426 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:36:51,427 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:36:51,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-04 00:36:51,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-04 00:36:51,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:51,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:51,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 00:36:51,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7015 proven. 459 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2025-03-04 00:36:54,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 561 proven. 489 refuted. 0 times theorem prover too weak. 9462 trivial. 0 not checked. [2025-03-04 00:36:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006702428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:57,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 20] total 45 [2025-03-04 00:36:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63053493] [2025-03-04 00:36:57,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 00:36:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:57,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 00:36:57,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1467, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 00:36:57,682 INFO L87 Difference]: Start difference. First operand 7786 states and 11937 transitions. Second operand has 45 states, 43 states have (on average 8.44186046511628) internal successors, (363), 41 states have internal predecessors, (363), 16 states have call successors, (219), 7 states have call predecessors, (219), 15 states have return successors, (219), 16 states have call predecessors, (219), 16 states have call successors, (219)