./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-15.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-15.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 74819a618e8737460ffe2d5e187bd0878af8b759d0d399e9d2ada8d393705a62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:30:06,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:30:06,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:30:06,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:30:06,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:30:06,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:30:06,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:30:06,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:30:06,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:30:06,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:30:06,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:30:06,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:30:06,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:30:06,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:30:06,626 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:30:06,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:30:06,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:30:06,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:06,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:30:06,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:30:06,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:30:06,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:30:06,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:30:06,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:30:06,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:30:06,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:30:06,629 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 -> 74819a618e8737460ffe2d5e187bd0878af8b759d0d399e9d2ada8d393705a62 [2025-03-04 00:30:06,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:30:06,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:30:06,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:30:06,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:30:06,860 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:30:06,861 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-15.i [2025-03-04 00:30:08,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84990d540/5e95ad451bc441f4a202edec6102f392/FLAG0971abb5a [2025-03-04 00:30:08,389 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:30:08,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-15.i [2025-03-04 00:30:08,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84990d540/5e95ad451bc441f4a202edec6102f392/FLAG0971abb5a [2025-03-04 00:30:08,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84990d540/5e95ad451bc441f4a202edec6102f392 [2025-03-04 00:30:08,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:30:08,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:30:08,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:08,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:30:08,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:30:08,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:08,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d49933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08, skipping insertion in model container [2025-03-04 00:30:08,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:08,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:30:08,555 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-15.i[916,929] [2025-03-04 00:30:08,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:08,713 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:30:08,722 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-15.i[916,929] [2025-03-04 00:30:08,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:08,835 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:30:08,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08 WrapperNode [2025-03-04 00:30:08,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:08,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:08,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:30:08,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:30:08,841 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:30:08" (1/1) ... [2025-03-04 00:30:08,855 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:30:08" (1/1) ... [2025-03-04 00:30:08,937 INFO L138 Inliner]: procedures = 26, calls = 105, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 816 [2025-03-04 00:30:08,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:08,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:30:08,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:30:08,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:30:08,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:08,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:08,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,038 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:30:09,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:30:09,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:30:09,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:30:09,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:30:09,102 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (1/1) ... [2025-03-04 00:30:09,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:09,127 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:30:09,130 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:30:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:30:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:30:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:30:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:30:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:30:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:30:09,272 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:30:09,273 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:30:10,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~short63#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short66#1;havoc property_#t~ite69#1;havoc property_#t~ite68#1;havoc property_#t~bitwise67#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1;havoc property_#t~ite74#1;havoc property_#t~bitwise73#1;havoc property_#t~short75#1; [2025-03-04 00:30:10,422 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-04 00:30:10,422 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:30:10,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:30:10,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:30:10,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:10 BoogieIcfgContainer [2025-03-04 00:30:10,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:30:10,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:30:10,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:30:10,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:30:10,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:30:08" (1/3) ... [2025-03-04 00:30:10,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1464050b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:10, skipping insertion in model container [2025-03-04 00:30:10,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:08" (2/3) ... [2025-03-04 00:30:10,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1464050b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:10, skipping insertion in model container [2025-03-04 00:30:10,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:10" (3/3) ... [2025-03-04 00:30:10,461 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-15.i [2025-03-04 00:30:10,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:30:10,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-15.i that has 2 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:30:10,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:30:10,539 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;@42a5f675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:30:10,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:30:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 231 states have (on average 1.5151515151515151) internal successors, (350), 232 states have internal predecessors, (350), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 00:30:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-04 00:30:10,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:10,574 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -80440017, now seen corresponding path program 1 times [2025-03-04 00:30:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766808240] [2025-03-04 00:30:10,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:10,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-04 00:30:10,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-04 00:30:10,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:10,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-04 00:30:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766808240] [2025-03-04 00:30:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766808240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:11,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369183963] [2025-03-04 00:30:11,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:11,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:11,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:11,214 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:30:11,216 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:30:11,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-04 00:30:11,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-04 00:30:11,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:11,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:30:11,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2025-03-04 00:30:11,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:30:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369183963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:30:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:30:11,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323125526] [2025-03-04 00:30:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:11,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:30:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:11,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:30:11,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:11,713 INFO L87 Difference]: Start difference. First operand has 326 states, 231 states have (on average 1.5151515151515151) internal successors, (350), 232 states have internal predecessors, (350), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-04 00:30:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:11,812 INFO L93 Difference]: Finished difference Result 646 states and 1155 transitions. [2025-03-04 00:30:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:30:11,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) Word has length 609 [2025-03-04 00:30:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:11,821 INFO L225 Difference]: With dead ends: 646 [2025-03-04 00:30:11,822 INFO L226 Difference]: Without dead ends: 323 [2025-03-04 00:30:11,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:11,828 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:11,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:30:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-04 00:30:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-04 00:30:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 229 states have (on average 1.5065502183406114) internal successors, (345), 229 states have internal predecessors, (345), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 00:30:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 529 transitions. [2025-03-04 00:30:11,897 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 529 transitions. Word has length 609 [2025-03-04 00:30:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:11,898 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 529 transitions. [2025-03-04 00:30:11,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (92), 2 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-04 00:30:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 529 transitions. [2025-03-04 00:30:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-04 00:30:11,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:11,912 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:30:12,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:30:12,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:12,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash -901123899, now seen corresponding path program 1 times [2025-03-04 00:30:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:12,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987717357] [2025-03-04 00:30:12,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:12,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-04 00:30:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-04 00:30:12,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:12,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987717357] [2025-03-04 00:30:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987717357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:12,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:12,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702438806] [2025-03-04 00:30:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:12,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:12,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:12,908 INFO L87 Difference]: Start difference. First operand 323 states and 529 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:13,041 INFO L93 Difference]: Finished difference Result 961 states and 1577 transitions. [2025-03-04 00:30:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 609 [2025-03-04 00:30:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:13,049 INFO L225 Difference]: With dead ends: 961 [2025-03-04 00:30:13,049 INFO L226 Difference]: Without dead ends: 641 [2025-03-04 00:30:13,050 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:30:13,051 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 515 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:13,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1172 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-04 00:30:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 344. [2025-03-04 00:30:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 250 states have (on average 1.52) internal successors, (380), 250 states have internal predecessors, (380), 92 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-04 00:30:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 564 transitions. [2025-03-04 00:30:13,108 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 564 transitions. Word has length 609 [2025-03-04 00:30:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:13,111 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 564 transitions. [2025-03-04 00:30:13,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 564 transitions. [2025-03-04 00:30:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-04 00:30:13,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:13,122 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:13,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:30:13,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:13,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:13,123 INFO L85 PathProgramCache]: Analyzing trace with hash -331661262, now seen corresponding path program 1 times [2025-03-04 00:30:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844693384] [2025-03-04 00:30:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-04 00:30:13,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-04 00:30:13,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:13,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:13,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844693384] [2025-03-04 00:30:13,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844693384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:13,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:13,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025718678] [2025-03-04 00:30:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:13,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:13,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:13,509 INFO L87 Difference]: Start difference. First operand 344 states and 564 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:13,639 INFO L93 Difference]: Finished difference Result 1022 states and 1678 transitions. [2025-03-04 00:30:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:13,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 610 [2025-03-04 00:30:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:13,649 INFO L225 Difference]: With dead ends: 1022 [2025-03-04 00:30:13,649 INFO L226 Difference]: Without dead ends: 681 [2025-03-04 00:30:13,650 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:30:13,651 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 476 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:13,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1315 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-04 00:30:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2025-03-04 00:30:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 490 states have (on average 1.510204081632653) internal successors, (740), 490 states have internal predecessors, (740), 184 states have call successors, (184), 2 states have call predecessors, (184), 2 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2025-03-04 00:30:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1108 transitions. [2025-03-04 00:30:13,724 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1108 transitions. Word has length 610 [2025-03-04 00:30:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:13,726 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1108 transitions. [2025-03-04 00:30:13,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1108 transitions. [2025-03-04 00:30:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-04 00:30:13,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:13,734 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:13,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:30:13,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 87855569, now seen corresponding path program 1 times [2025-03-04 00:30:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134175140] [2025-03-04 00:30:13,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:13,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-04 00:30:13,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-04 00:30:13,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:13,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134175140] [2025-03-04 00:30:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134175140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600127691] [2025-03-04 00:30:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:14,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:14,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:14,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:14,063 INFO L87 Difference]: Start difference. First operand 677 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:14,170 INFO L93 Difference]: Finished difference Result 1358 states and 2223 transitions. [2025-03-04 00:30:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 610 [2025-03-04 00:30:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:14,178 INFO L225 Difference]: With dead ends: 1358 [2025-03-04 00:30:14,179 INFO L226 Difference]: Without dead ends: 684 [2025-03-04 00:30:14,182 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:30:14,183 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 466 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:14,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1193 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-04 00:30:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 680. [2025-03-04 00:30:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 493 states have (on average 1.5050709939148073) internal successors, (742), 493 states have internal predecessors, (742), 184 states have call successors, (184), 2 states have call predecessors, (184), 2 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2025-03-04 00:30:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1110 transitions. [2025-03-04 00:30:14,241 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1110 transitions. Word has length 610 [2025-03-04 00:30:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:14,243 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1110 transitions. [2025-03-04 00:30:14,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1110 transitions. [2025-03-04 00:30:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-04 00:30:14,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:14,268 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:14,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:30:14,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:14,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash -448332148, now seen corresponding path program 1 times [2025-03-04 00:30:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:14,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428447684] [2025-03-04 00:30:14,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:14,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-04 00:30:14,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-04 00:30:14,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:14,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:14,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:14,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428447684] [2025-03-04 00:30:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428447684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017629124] [2025-03-04 00:30:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:14,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:14,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:14,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:14,539 INFO L87 Difference]: Start difference. First operand 680 states and 1110 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:14,657 INFO L93 Difference]: Finished difference Result 1653 states and 2674 transitions. [2025-03-04 00:30:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 611 [2025-03-04 00:30:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:14,664 INFO L225 Difference]: With dead ends: 1653 [2025-03-04 00:30:14,664 INFO L226 Difference]: Without dead ends: 976 [2025-03-04 00:30:14,667 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:30:14,667 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 213 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:14,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1085 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-04 00:30:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 972. [2025-03-04 00:30:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 749 states have (on average 1.4966622162883845) internal successors, (1121), 751 states have internal predecessors, (1121), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-04 00:30:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1557 transitions. [2025-03-04 00:30:14,757 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1557 transitions. Word has length 611 [2025-03-04 00:30:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1557 transitions. [2025-03-04 00:30:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1557 transitions. [2025-03-04 00:30:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-04 00:30:14,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:14,765 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:14,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:30:14,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 142640359, now seen corresponding path program 1 times [2025-03-04 00:30:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942061045] [2025-03-04 00:30:14,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-04 00:30:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-04 00:30:14,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:14,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942061045] [2025-03-04 00:30:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942061045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:15,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131069487] [2025-03-04 00:30:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:15,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:15,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:15,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:15,469 INFO L87 Difference]: Start difference. First operand 972 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:15,622 INFO L93 Difference]: Finished difference Result 2910 states and 4665 transitions. [2025-03-04 00:30:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:15,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 611 [2025-03-04 00:30:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:15,635 INFO L225 Difference]: With dead ends: 2910 [2025-03-04 00:30:15,635 INFO L226 Difference]: Without dead ends: 1941 [2025-03-04 00:30:15,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:15,639 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 367 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:15,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1178 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-03-04 00:30:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1939. [2025-03-04 00:30:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1494 states have (on average 1.4899598393574298) internal successors, (2226), 1498 states have internal predecessors, (2226), 436 states have call successors, (436), 8 states have call predecessors, (436), 8 states have return successors, (436), 432 states have call predecessors, (436), 436 states have call successors, (436) [2025-03-04 00:30:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 3098 transitions. [2025-03-04 00:30:15,756 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 3098 transitions. Word has length 611 [2025-03-04 00:30:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:15,757 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 3098 transitions. [2025-03-04 00:30:15,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 3098 transitions. [2025-03-04 00:30:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-04 00:30:15,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:15,763 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:15,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:30:15,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:15,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash 134639161, now seen corresponding path program 1 times [2025-03-04 00:30:15,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401360348] [2025-03-04 00:30:15,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:15,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-04 00:30:15,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-04 00:30:15,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:15,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:16,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401360348] [2025-03-04 00:30:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401360348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:16,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:16,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:30:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292660809] [2025-03-04 00:30:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:16,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:30:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:16,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:30:16,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:16,627 INFO L87 Difference]: Start difference. First operand 1939 states and 3098 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:17,020 INFO L93 Difference]: Finished difference Result 5327 states and 8476 transitions. [2025-03-04 00:30:17,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:30:17,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 612 [2025-03-04 00:30:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:17,042 INFO L225 Difference]: With dead ends: 5327 [2025-03-04 00:30:17,042 INFO L226 Difference]: Without dead ends: 3391 [2025-03-04 00:30:17,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:30:17,049 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 306 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:17,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 2445 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2025-03-04 00:30:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 3385. [2025-03-04 00:30:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 2764 states have (on average 1.5065123010130246) internal successors, (4164), 2776 states have internal predecessors, (4164), 604 states have call successors, (604), 16 states have call predecessors, (604), 16 states have return successors, (604), 592 states have call predecessors, (604), 604 states have call successors, (604) [2025-03-04 00:30:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 5372 transitions. [2025-03-04 00:30:17,264 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 5372 transitions. Word has length 612 [2025-03-04 00:30:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:17,265 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 5372 transitions. [2025-03-04 00:30:17,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 5372 transitions. [2025-03-04 00:30:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-04 00:30:17,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:17,273 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:17,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:30:17,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash -349036166, now seen corresponding path program 1 times [2025-03-04 00:30:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271208680] [2025-03-04 00:30:17,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:17,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-04 00:30:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-04 00:30:17,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:18,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271208680] [2025-03-04 00:30:18,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271208680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:18,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16261910] [2025-03-04 00:30:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:18,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:18,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:18,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:18,347 INFO L87 Difference]: Start difference. First operand 3385 states and 5372 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:18,766 INFO L93 Difference]: Finished difference Result 11207 states and 17715 transitions. [2025-03-04 00:30:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 612 [2025-03-04 00:30:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:18,805 INFO L225 Difference]: With dead ends: 11207 [2025-03-04 00:30:18,806 INFO L226 Difference]: Without dead ends: 7825 [2025-03-04 00:30:18,818 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:30:18,819 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 587 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:18,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1520 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2025-03-04 00:30:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 4301. [2025-03-04 00:30:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4301 states, 3680 states have (on average 1.5326086956521738) internal successors, (5640), 3692 states have internal predecessors, (5640), 604 states have call successors, (604), 16 states have call predecessors, (604), 16 states have return successors, (604), 592 states have call predecessors, (604), 604 states have call successors, (604) [2025-03-04 00:30:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 6848 transitions. [2025-03-04 00:30:19,072 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 6848 transitions. Word has length 612 [2025-03-04 00:30:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:19,072 INFO L471 AbstractCegarLoop]: Abstraction has 4301 states and 6848 transitions. [2025-03-04 00:30:19,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 6848 transitions. [2025-03-04 00:30:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-04 00:30:19,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:19,080 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:19,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:30:19,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1775331813, now seen corresponding path program 1 times [2025-03-04 00:30:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:19,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265846196] [2025-03-04 00:30:19,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:19,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-04 00:30:19,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-04 00:30:19,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:19,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265846196] [2025-03-04 00:30:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265846196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:20,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001575986] [2025-03-04 00:30:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:20,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:20,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:20,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:20,148 INFO L87 Difference]: Start difference. First operand 4301 states and 6848 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:20,899 INFO L93 Difference]: Finished difference Result 14569 states and 23100 transitions. [2025-03-04 00:30:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:30:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 612 [2025-03-04 00:30:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:20,949 INFO L225 Difference]: With dead ends: 14569 [2025-03-04 00:30:20,950 INFO L226 Difference]: Without dead ends: 10271 [2025-03-04 00:30:20,959 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:30:20,960 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 943 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:20,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1701 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:30:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10271 states. [2025-03-04 00:30:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10271 to 6205. [2025-03-04 00:30:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6205 states, 5100 states have (on average 1.5098039215686274) internal successors, (7700), 5116 states have internal predecessors, (7700), 1072 states have call successors, (1072), 32 states have call predecessors, (1072), 32 states have return successors, (1072), 1056 states have call predecessors, (1072), 1072 states have call successors, (1072) [2025-03-04 00:30:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 9844 transitions. [2025-03-04 00:30:21,314 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 9844 transitions. Word has length 612 [2025-03-04 00:30:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:21,315 INFO L471 AbstractCegarLoop]: Abstraction has 6205 states and 9844 transitions. [2025-03-04 00:30:21,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 9844 transitions. [2025-03-04 00:30:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-04 00:30:21,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:21,324 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:21,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:30:21,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1420227163, now seen corresponding path program 1 times [2025-03-04 00:30:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338338092] [2025-03-04 00:30:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:21,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-04 00:30:21,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-04 00:30:21,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:21,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338338092] [2025-03-04 00:30:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338338092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446254296] [2025-03-04 00:30:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:21,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:21,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:21,609 INFO L87 Difference]: Start difference. First operand 6205 states and 9844 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:22,063 INFO L93 Difference]: Finished difference Result 13379 states and 21147 transitions. [2025-03-04 00:30:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 612 [2025-03-04 00:30:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:22,095 INFO L225 Difference]: With dead ends: 13379 [2025-03-04 00:30:22,095 INFO L226 Difference]: Without dead ends: 7177 [2025-03-04 00:30:22,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:22,113 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 762 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:22,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1273 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2025-03-04 00:30:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 5525. [2025-03-04 00:30:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5525 states, 4488 states have (on average 1.5066844919786095) internal successors, (6762), 4500 states have internal predecessors, (6762), 1004 states have call successors, (1004), 32 states have call predecessors, (1004), 32 states have return successors, (1004), 992 states have call predecessors, (1004), 1004 states have call successors, (1004) [2025-03-04 00:30:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 8770 transitions. [2025-03-04 00:30:22,456 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 8770 transitions. Word has length 612 [2025-03-04 00:30:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:22,457 INFO L471 AbstractCegarLoop]: Abstraction has 5525 states and 8770 transitions. [2025-03-04 00:30:22,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 8770 transitions. [2025-03-04 00:30:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-04 00:30:22,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:22,468 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:22,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:30:22,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:22,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 891308124, now seen corresponding path program 1 times [2025-03-04 00:30:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753931813] [2025-03-04 00:30:22,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:22,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-04 00:30:22,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-04 00:30:22,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:23,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753931813] [2025-03-04 00:30:23,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753931813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:23,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:23,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:23,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90374900] [2025-03-04 00:30:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:23,026 INFO L87 Difference]: Start difference. First operand 5525 states and 8770 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:23,412 INFO L93 Difference]: Finished difference Result 14133 states and 22428 transitions. [2025-03-04 00:30:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 612 [2025-03-04 00:30:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:23,455 INFO L225 Difference]: With dead ends: 14133 [2025-03-04 00:30:23,455 INFO L226 Difference]: Without dead ends: 8611 [2025-03-04 00:30:23,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:30:23,471 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 478 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:23,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1507 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2025-03-04 00:30:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 8573. [2025-03-04 00:30:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8573 states, 6984 states have (on average 1.5040091638029782) internal successors, (10504), 7004 states have internal predecessors, (10504), 1540 states have call successors, (1540), 48 states have call predecessors, (1540), 48 states have return successors, (1540), 1520 states have call predecessors, (1540), 1540 states have call successors, (1540) [2025-03-04 00:30:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 13584 transitions. [2025-03-04 00:30:23,972 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 13584 transitions. Word has length 612 [2025-03-04 00:30:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:23,973 INFO L471 AbstractCegarLoop]: Abstraction has 8573 states and 13584 transitions. [2025-03-04 00:30:23,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 13584 transitions. [2025-03-04 00:30:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-04 00:30:23,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:23,983 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:23,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:30:23,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:23,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash -133385797, now seen corresponding path program 1 times [2025-03-04 00:30:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:23,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609559781] [2025-03-04 00:30:23,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:23,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:24,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-04 00:30:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-04 00:30:24,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:25,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609559781] [2025-03-04 00:30:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609559781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264817002] [2025-03-04 00:30:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:25,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:25,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:25,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:25,011 INFO L87 Difference]: Start difference. First operand 8573 states and 13584 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:25,640 INFO L93 Difference]: Finished difference Result 22471 states and 35556 transitions. [2025-03-04 00:30:25,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:25,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 612 [2025-03-04 00:30:25,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:25,682 INFO L225 Difference]: With dead ends: 22471 [2025-03-04 00:30:25,683 INFO L226 Difference]: Without dead ends: 13901 [2025-03-04 00:30:25,709 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:30:25,710 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 460 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:25,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1523 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:30:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13901 states. [2025-03-04 00:30:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13901 to 13579. [2025-03-04 00:30:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13579 states, 11896 states have (on average 1.535053799596503) internal successors, (18261), 11916 states have internal predecessors, (18261), 1632 states have call successors, (1632), 50 states have call predecessors, (1632), 50 states have return successors, (1632), 1612 states have call predecessors, (1632), 1632 states have call successors, (1632) [2025-03-04 00:30:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13579 states to 13579 states and 21525 transitions. [2025-03-04 00:30:26,264 INFO L78 Accepts]: Start accepts. Automaton has 13579 states and 21525 transitions. Word has length 612 [2025-03-04 00:30:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 13579 states and 21525 transitions. [2025-03-04 00:30:26,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 13579 states and 21525 transitions. [2025-03-04 00:30:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-04 00:30:26,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:26,275 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:30:26,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:26,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1799699355, now seen corresponding path program 1 times [2025-03-04 00:30:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068331338] [2025-03-04 00:30:26,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:26,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-04 00:30:26,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-04 00:30:26,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:26,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:28,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068331338] [2025-03-04 00:30:28,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068331338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:28,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:28,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:30:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156751765] [2025-03-04 00:30:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:28,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:30:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:30:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:30:28,288 INFO L87 Difference]: Start difference. First operand 13579 states and 21525 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-04 00:30:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:30,116 INFO L93 Difference]: Finished difference Result 38869 states and 61486 transitions. [2025-03-04 00:30:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:30:30,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) Word has length 614 [2025-03-04 00:30:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:30,187 INFO L225 Difference]: With dead ends: 38869 [2025-03-04 00:30:30,187 INFO L226 Difference]: Without dead ends: 26067 [2025-03-04 00:30:30,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:30:30,219 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 953 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:30,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 1981 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:30:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26067 states. [2025-03-04 00:30:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26067 to 26053. [2025-03-04 00:30:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26053 states, 23381 states have (on average 1.5395406526666953) internal successors, (35996), 23433 states have internal predecessors, (35996), 2560 states have call successors, (2560), 111 states have call predecessors, (2560), 111 states have return successors, (2560), 2508 states have call predecessors, (2560), 2560 states have call successors, (2560) [2025-03-04 00:30:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26053 states to 26053 states and 41116 transitions. [2025-03-04 00:30:31,147 INFO L78 Accepts]: Start accepts. Automaton has 26053 states and 41116 transitions. Word has length 614 [2025-03-04 00:30:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:31,148 INFO L471 AbstractCegarLoop]: Abstraction has 26053 states and 41116 transitions. [2025-03-04 00:30:31,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 2 states have call predecessors, (92), 2 states have call successors, (92) [2025-03-04 00:30:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26053 states and 41116 transitions. [2025-03-04 00:30:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-03-04 00:30:31,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:31,251 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:31,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:30:31,255 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:31,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1553386268, now seen corresponding path program 1 times [2025-03-04 00:30:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678579075] [2025-03-04 00:30:31,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-04 00:30:32,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-04 00:30:32,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:32,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 51 proven. 222 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:32,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:32,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678579075] [2025-03-04 00:30:32,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678579075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:32,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284618547] [2025-03-04 00:30:32,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:32,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:32,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:32,900 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:30:32,901 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:30:33,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-03-04 00:30:33,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-03-04 00:30:33,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:33,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:33,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:30:33,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 10285 proven. 189 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2025-03-04 00:30:34,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:30:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284618547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:35,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:30:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 16 [2025-03-04 00:30:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138805639] [2025-03-04 00:30:35,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:30:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:30:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:35,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:30:35,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:30:35,171 INFO L87 Difference]: Start difference. First operand 26053 states and 41116 transitions. Second operand has 16 states, 16 states have (on average 17.875) internal successors, (286), 16 states have internal predecessors, (286), 4 states have call successors, (166), 3 states have call predecessors, (166), 5 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) [2025-03-04 00:30:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:40,482 INFO L93 Difference]: Finished difference Result 48805 states and 77028 transitions. [2025-03-04 00:30:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 00:30:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 17.875) internal successors, (286), 16 states have internal predecessors, (286), 4 states have call successors, (166), 3 states have call predecessors, (166), 5 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) Word has length 614 [2025-03-04 00:30:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:40,546 INFO L225 Difference]: With dead ends: 48805 [2025-03-04 00:30:40,546 INFO L226 Difference]: Without dead ends: 24383 [2025-03-04 00:30:40,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 00:30:40,578 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 2368 mSDsluCounter, 4423 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 5062 SdHoareTripleChecker+Invalid, 3726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:40,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 5062 Invalid, 3726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 3369 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-04 00:30:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2025-03-04 00:30:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 18646. [2025-03-04 00:30:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18646 states, 16555 states have (on average 1.5136816671700393) internal successors, (25059), 16597 states have internal predecessors, (25059), 1910 states have call successors, (1910), 180 states have call predecessors, (1910), 180 states have return successors, (1910), 1868 states have call predecessors, (1910), 1910 states have call successors, (1910) [2025-03-04 00:30:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18646 states to 18646 states and 28879 transitions. [2025-03-04 00:30:41,550 INFO L78 Accepts]: Start accepts. Automaton has 18646 states and 28879 transitions. Word has length 614 [2025-03-04 00:30:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:41,551 INFO L471 AbstractCegarLoop]: Abstraction has 18646 states and 28879 transitions. [2025-03-04 00:30:41,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 17.875) internal successors, (286), 16 states have internal predecessors, (286), 4 states have call successors, (166), 3 states have call predecessors, (166), 5 states have return successors, (167), 4 states have call predecessors, (167), 4 states have call successors, (167) [2025-03-04 00:30:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 18646 states and 28879 transitions. [2025-03-04 00:30:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-03-04 00:30:41,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:41,566 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:41,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:30:41,767 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,SelfDestructingSolverStorable13 [2025-03-04 00:30:41,767 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2068535928, now seen corresponding path program 1 times [2025-03-04 00:30:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524430121] [2025-03-04 00:30:41,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:41,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-04 00:30:43,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 00:30:43,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 75 proven. 198 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524430121] [2025-03-04 00:30:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524430121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878540540] [2025-03-04 00:30:43,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:43,716 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:30:43,718 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:30:43,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-04 00:30:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 00:30:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:44,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:30:44,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8307 proven. 117 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:30:44,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:30:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 156 proven. 117 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878540540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:30:44,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:30:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-04 00:30:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518603230] [2025-03-04 00:30:44,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:30:44,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:30:44,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:44,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:30:44,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:30:44,774 INFO L87 Difference]: Start difference. First operand 18646 states and 28879 transitions. Second operand has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 3 states have call successors, (197), 2 states have call predecessors, (197), 4 states have return successors, (199), 3 states have call predecessors, (199), 3 states have call successors, (199) [2025-03-04 00:30:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:45,804 INFO L93 Difference]: Finished difference Result 28416 states and 43909 transitions. [2025-03-04 00:30:45,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:30:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 3 states have call successors, (197), 2 states have call predecessors, (197), 4 states have return successors, (199), 3 states have call predecessors, (199), 3 states have call successors, (199) Word has length 615 [2025-03-04 00:30:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:45,848 INFO L225 Difference]: With dead ends: 28416 [2025-03-04 00:30:45,849 INFO L226 Difference]: Without dead ends: 10395 [2025-03-04 00:30:45,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1227 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:30:45,876 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 860 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:45,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1675 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:30:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10395 states. [2025-03-04 00:30:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10395 to 10303. [2025-03-04 00:30:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10303 states, 8852 states have (on average 1.494916403072752) internal successors, (13233), 8870 states have internal predecessors, (13233), 1310 states have call successors, (1310), 140 states have call predecessors, (1310), 140 states have return successors, (1310), 1292 states have call predecessors, (1310), 1310 states have call successors, (1310) [2025-03-04 00:30:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10303 states to 10303 states and 15853 transitions. [2025-03-04 00:30:46,486 INFO L78 Accepts]: Start accepts. Automaton has 10303 states and 15853 transitions. Word has length 615 [2025-03-04 00:30:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:46,487 INFO L471 AbstractCegarLoop]: Abstraction has 10303 states and 15853 transitions. [2025-03-04 00:30:46,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 3 states have call successors, (197), 2 states have call predecessors, (197), 4 states have return successors, (199), 3 states have call predecessors, (199), 3 states have call successors, (199) [2025-03-04 00:30:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10303 states and 15853 transitions. [2025-03-04 00:30:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-03-04 00:30:46,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:46,495 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:46,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:30:46,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:46,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:46,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1399489338, now seen corresponding path program 1 times [2025-03-04 00:30:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227774154] [2025-03-04 00:30:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:46,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-04 00:30:47,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 00:30:47,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:47,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227774154] [2025-03-04 00:30:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227774154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56457722] [2025-03-04 00:30:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:47,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:47,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:47,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:47,454 INFO L87 Difference]: Start difference. First operand 10303 states and 15853 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:47,846 INFO L93 Difference]: Finished difference Result 19103 states and 29210 transitions. [2025-03-04 00:30:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 615 [2025-03-04 00:30:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:47,872 INFO L225 Difference]: With dead ends: 19103 [2025-03-04 00:30:47,873 INFO L226 Difference]: Without dead ends: 9631 [2025-03-04 00:30:47,885 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:30:47,886 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 510 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:47,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 492 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:30:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2025-03-04 00:30:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 9631. [2025-03-04 00:30:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9631 states, 8180 states have (on average 1.4680929095354522) internal successors, (12009), 8198 states have internal predecessors, (12009), 1310 states have call successors, (1310), 140 states have call predecessors, (1310), 140 states have return successors, (1310), 1292 states have call predecessors, (1310), 1310 states have call successors, (1310) [2025-03-04 00:30:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9631 states to 9631 states and 14629 transitions. [2025-03-04 00:30:48,400 INFO L78 Accepts]: Start accepts. Automaton has 9631 states and 14629 transitions. Word has length 615 [2025-03-04 00:30:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:48,401 INFO L471 AbstractCegarLoop]: Abstraction has 9631 states and 14629 transitions. [2025-03-04 00:30:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 9631 states and 14629 transitions. [2025-03-04 00:30:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-03-04 00:30:48,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:48,410 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:30:48,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1538092762, now seen corresponding path program 1 times [2025-03-04 00:30:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812195094] [2025-03-04 00:30:48,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:48,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-04 00:30:49,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 00:30:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 81 proven. 192 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812195094] [2025-03-04 00:30:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812195094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:49,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755292533] [2025-03-04 00:30:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:49,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:49,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:49,946 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:30:49,949 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:30:50,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-03-04 00:30:50,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-03-04 00:30:50,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:50,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:30:50,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 7057 proven. 192 refuted. 0 times theorem prover too weak. 9495 trivial. 0 not checked. [2025-03-04 00:30:50,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:30:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 81 proven. 192 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755292533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:30:50,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:30:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:30:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970554048] [2025-03-04 00:30:50,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:30:50,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:30:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:50,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:30:50,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:30:50,968 INFO L87 Difference]: Start difference. First operand 9631 states and 14629 transitions. Second operand has 8 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 3 states have call successors, (220), 2 states have call predecessors, (220), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) [2025-03-04 00:30:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:51,693 INFO L93 Difference]: Finished difference Result 17609 states and 26563 transitions. [2025-03-04 00:30:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:30:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 3 states have call successors, (220), 2 states have call predecessors, (220), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) Word has length 615 [2025-03-04 00:30:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:51,723 INFO L225 Difference]: With dead ends: 17609 [2025-03-04 00:30:51,723 INFO L226 Difference]: Without dead ends: 9787 [2025-03-04 00:30:51,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1227 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:30:51,739 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 244 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:51,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1012 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2025-03-04 00:30:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 9695. [2025-03-04 00:30:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9695 states, 8219 states have (on average 1.4527314758486434) internal successors, (11940), 8237 states have internal predecessors, (11940), 1310 states have call successors, (1310), 165 states have call predecessors, (1310), 165 states have return successors, (1310), 1292 states have call predecessors, (1310), 1310 states have call successors, (1310) [2025-03-04 00:30:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9695 states to 9695 states and 14560 transitions. [2025-03-04 00:30:52,196 INFO L78 Accepts]: Start accepts. Automaton has 9695 states and 14560 transitions. Word has length 615 [2025-03-04 00:30:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:52,197 INFO L471 AbstractCegarLoop]: Abstraction has 9695 states and 14560 transitions. [2025-03-04 00:30:52,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 8 states have internal predecessors, (277), 3 states have call successors, (220), 2 states have call predecessors, (220), 4 states have return successors, (221), 3 states have call predecessors, (221), 3 states have call successors, (221) [2025-03-04 00:30:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9695 states and 14560 transitions. [2025-03-04 00:30:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-04 00:30:52,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:52,203 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:52,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:30:52,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 00:30:52,404 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 958663960, now seen corresponding path program 1 times [2025-03-04 00:30:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675445375] [2025-03-04 00:30:52,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:52,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-04 00:30:53,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-04 00:30:53,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:53,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 162 proven. 111 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675445375] [2025-03-04 00:30:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675445375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826006482] [2025-03-04 00:30:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:53,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:53,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:53,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:30:53,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:30:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-04 00:30:54,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-04 00:30:54,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:54,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:30:54,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8191 proven. 111 refuted. 0 times theorem prover too weak. 8442 trivial. 0 not checked. [2025-03-04 00:30:54,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:30:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 162 proven. 111 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:30:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826006482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:30:54,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:30:54,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:30:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120258967] [2025-03-04 00:30:54,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:30:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:30:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:54,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:30:54,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:30:54,778 INFO L87 Difference]: Start difference. First operand 9695 states and 14560 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) [2025-03-04 00:30:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:55,474 INFO L93 Difference]: Finished difference Result 19313 states and 28932 transitions. [2025-03-04 00:30:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:30:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) Word has length 616 [2025-03-04 00:30:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:55,505 INFO L225 Difference]: With dead ends: 19313 [2025-03-04 00:30:55,505 INFO L226 Difference]: Without dead ends: 9829 [2025-03-04 00:30:55,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1229 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:30:55,523 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 652 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:55,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1016 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9829 states. [2025-03-04 00:30:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9829 to 9723. [2025-03-04 00:30:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9723 states, 8240 states have (on average 1.4439320388349515) internal successors, (11898), 8258 states have internal predecessors, (11898), 1310 states have call successors, (1310), 172 states have call predecessors, (1310), 172 states have return successors, (1310), 1292 states have call predecessors, (1310), 1310 states have call successors, (1310) [2025-03-04 00:30:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 14518 transitions. [2025-03-04 00:30:56,062 INFO L78 Accepts]: Start accepts. Automaton has 9723 states and 14518 transitions. Word has length 616 [2025-03-04 00:30:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 9723 states and 14518 transitions. [2025-03-04 00:30:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 2 states have call successors, (129), 2 states have call predecessors, (129), 4 states have return successors, (130), 2 states have call predecessors, (130), 2 states have call successors, (130) [2025-03-04 00:30:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9723 states and 14518 transitions. [2025-03-04 00:30:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-04 00:30:56,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:56,069 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:56,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:30:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 00:30:56,270 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:56,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1581538888, now seen corresponding path program 1 times [2025-03-04 00:30:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209787795] [2025-03-04 00:30:56,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:56,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-04 00:30:56,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-04 00:30:56,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:56,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:30:56,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:56,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209787795] [2025-03-04 00:30:56,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209787795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:56,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:56,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:30:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548117805] [2025-03-04 00:30:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:56,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:30:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:56,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:30:56,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:56,876 INFO L87 Difference]: Start difference. First operand 9723 states and 14518 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:58,741 INFO L93 Difference]: Finished difference Result 26849 states and 39870 transitions. [2025-03-04 00:30:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:30:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 616 [2025-03-04 00:30:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:58,786 INFO L225 Difference]: With dead ends: 26849 [2025-03-04 00:30:58,786 INFO L226 Difference]: Without dead ends: 17785 [2025-03-04 00:30:58,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:30:58,805 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1389 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:58,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1794 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:30:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17785 states. [2025-03-04 00:30:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17785 to 8248. [2025-03-04 00:30:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8248 states, 7272 states have (on average 1.4646589658965896) internal successors, (10651), 7278 states have internal predecessors, (10651), 854 states have call successors, (854), 121 states have call predecessors, (854), 121 states have return successors, (854), 848 states have call predecessors, (854), 854 states have call successors, (854) [2025-03-04 00:30:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8248 states to 8248 states and 12359 transitions. [2025-03-04 00:30:59,346 INFO L78 Accepts]: Start accepts. Automaton has 8248 states and 12359 transitions. Word has length 616 [2025-03-04 00:30:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 8248 states and 12359 transitions. [2025-03-04 00:30:59,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:30:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 8248 states and 12359 transitions. [2025-03-04 00:30:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-04 00:30:59,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:59,352 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:30:59,353 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:59,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1561201513, now seen corresponding path program 1 times [2025-03-04 00:30:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492392486] [2025-03-04 00:30:59,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:59,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-04 00:31:00,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-04 00:31:00,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:00,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 198 proven. 75 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:31:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:00,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492392486] [2025-03-04 00:31:00,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492392486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:00,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842047837] [2025-03-04 00:31:00,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:00,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:00,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:00,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:31:00,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-04 00:31:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-04 00:31:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:01,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:31:01,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 6823 proven. 75 refuted. 0 times theorem prover too weak. 9846 trivial. 0 not checked. [2025-03-04 00:31:01,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 198 proven. 75 refuted. 0 times theorem prover too weak. 16471 trivial. 0 not checked. [2025-03-04 00:31:01,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842047837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:01,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 00:31:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132111110] [2025-03-04 00:31:01,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:01,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:31:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:01,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:31:01,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:01,477 INFO L87 Difference]: Start difference. First operand 8248 states and 12359 transitions. Second operand has 11 states, 11 states have (on average 17.0) internal successors, (187), 11 states have internal predecessors, (187), 3 states have call successors, (142), 2 states have call predecessors, (142), 4 states have return successors, (143), 3 states have call predecessors, (143), 3 states have call successors, (143) [2025-03-04 00:31:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:02,510 INFO L93 Difference]: Finished difference Result 14491 states and 21595 transitions. [2025-03-04 00:31:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:31:02,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.0) internal successors, (187), 11 states have internal predecessors, (187), 3 states have call successors, (142), 2 states have call predecessors, (142), 4 states have return successors, (143), 3 states have call predecessors, (143), 3 states have call successors, (143) Word has length 616 [2025-03-04 00:31:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:02,536 INFO L225 Difference]: With dead ends: 14491 [2025-03-04 00:31:02,536 INFO L226 Difference]: Without dead ends: 7722 [2025-03-04 00:31:02,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1227 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:31:02,548 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 991 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:02,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1873 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:31:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7722 states. [2025-03-04 00:31:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7722 to 7640. [2025-03-04 00:31:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 6657 states have (on average 1.4539582394471984) internal successors, (9679), 6663 states have internal predecessors, (9679), 854 states have call successors, (854), 128 states have call predecessors, (854), 128 states have return successors, (854), 848 states have call predecessors, (854), 854 states have call successors, (854) [2025-03-04 00:31:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 11387 transitions. [2025-03-04 00:31:02,977 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 11387 transitions. Word has length 616 [2025-03-04 00:31:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:02,978 INFO L471 AbstractCegarLoop]: Abstraction has 7640 states and 11387 transitions. [2025-03-04 00:31:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.0) internal successors, (187), 11 states have internal predecessors, (187), 3 states have call successors, (142), 2 states have call predecessors, (142), 4 states have return successors, (143), 3 states have call predecessors, (143), 3 states have call successors, (143) [2025-03-04 00:31:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 11387 transitions. [2025-03-04 00:31:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-03-04 00:31:02,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:02,983 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:02,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:31:03,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:03,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -520468701, now seen corresponding path program 1 times [2025-03-04 00:31:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396227743] [2025-03-04 00:31:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:03,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-04 00:31:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-04 00:31:03,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:03,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 471 proven. 330 refuted. 0 times theorem prover too weak. 15943 trivial. 0 not checked. [2025-03-04 00:31:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396227743] [2025-03-04 00:31:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396227743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749426447] [2025-03-04 00:31:09,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:09,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:09,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:31:09,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-04 00:31:09,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-04 00:31:09,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:09,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:09,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:31:09,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16744 trivial. 0 not checked. [2025-03-04 00:31:09,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:31:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749426447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:31:09,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2025-03-04 00:31:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565862288] [2025-03-04 00:31:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:09,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:09,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:31:09,964 INFO L87 Difference]: Start difference. First operand 7640 states and 11387 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:31:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:10,525 INFO L93 Difference]: Finished difference Result 13986 states and 20824 transitions. [2025-03-04 00:31:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) Word has length 617 [2025-03-04 00:31:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:10,545 INFO L225 Difference]: With dead ends: 13986 [2025-03-04 00:31:10,545 INFO L226 Difference]: Without dead ends: 8531 [2025-03-04 00:31:10,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 625 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:31:10,554 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 285 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:10,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1032 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8531 states. [2025-03-04 00:31:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8531 to 7737. [2025-03-04 00:31:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7737 states, 6987 states have (on average 1.473736940031487) internal successors, (10297), 6987 states have internal predecessors, (10297), 644 states have call successors, (644), 105 states have call predecessors, (644), 105 states have return successors, (644), 644 states have call predecessors, (644), 644 states have call successors, (644) [2025-03-04 00:31:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7737 states to 7737 states and 11585 transitions. [2025-03-04 00:31:10,894 INFO L78 Accepts]: Start accepts. Automaton has 7737 states and 11585 transitions. Word has length 617 [2025-03-04 00:31:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:10,895 INFO L471 AbstractCegarLoop]: Abstraction has 7737 states and 11585 transitions. [2025-03-04 00:31:10,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (92), 1 states have call predecessors, (92), 1 states have return successors, (92), 1 states have call predecessors, (92), 1 states have call successors, (92) [2025-03-04 00:31:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 7737 states and 11585 transitions. [2025-03-04 00:31:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-03-04 00:31:10,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:10,900 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:31:11,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:11,100 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:11,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1034195864, now seen corresponding path program 1 times [2025-03-04 00:31:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956816498] [2025-03-04 00:31:11,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:11,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-04 00:31:12,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-04 00:31:12,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:12,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 288 proven. 252 refuted. 0 times theorem prover too weak. 16204 trivial. 0 not checked. [2025-03-04 00:31:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:12,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956816498] [2025-03-04 00:31:12,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956816498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948960357] [2025-03-04 00:31:12,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:12,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:12,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:12,901 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31:12,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:31:13,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-04 00:31:13,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-04 00:31:13,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:13,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:13,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:31:13,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 11629 proven. 420 refuted. 0 times theorem prover too weak. 4695 trivial. 0 not checked. [2025-03-04 00:31:14,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 636 proven. 438 refuted. 0 times theorem prover too weak. 15670 trivial. 0 not checked. [2025-03-04 00:31:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948960357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:16,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 17] total 35 [2025-03-04 00:31:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344004251] [2025-03-04 00:31:16,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 00:31:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:16,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 00:31:16,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:31:16,887 INFO L87 Difference]: Start difference. First operand 7737 states and 11585 transitions. Second operand has 35 states, 34 states have (on average 11.911764705882353) internal successors, (405), 33 states have internal predecessors, (405), 10 states have call successors, (200), 5 states have call predecessors, (200), 12 states have return successors, (201), 10 states have call predecessors, (201), 10 states have call successors, (201)