./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-37.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 5a6bb657185a8971ac59b78fdd6847366fd3bff8285db535888533d16204ace0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:43:26,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:43:26,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:43:26,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:43:26,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:43:26,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:43:26,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:43:26,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:43:26,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:43:26,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:43:26,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:43:26,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:43:26,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:43:26,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:43:26,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:43:26,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:43:26,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:43:26,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:43:26,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:43:26,341 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 -> 5a6bb657185a8971ac59b78fdd6847366fd3bff8285db535888533d16204ace0 [2025-03-08 15:43:26,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:43:26,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:43:26,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:43:26,627 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:43:26,627 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:43:26,629 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-37.i [2025-03-08 15:43:27,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fdd5d816/c68d3e12921a4ee881af4b22b15edd4a/FLAGd72af4f1f [2025-03-08 15:43:28,079 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:43:28,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-37.i [2025-03-08 15:43:28,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fdd5d816/c68d3e12921a4ee881af4b22b15edd4a/FLAGd72af4f1f [2025-03-08 15:43:28,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fdd5d816/c68d3e12921a4ee881af4b22b15edd4a [2025-03-08 15:43:28,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:43:28,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:43:28,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:43:28,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:43:28,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:43:28,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b76cc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28, skipping insertion in model container [2025-03-08 15:43:28,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:43:28,258 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-37.i[916,929] [2025-03-08 15:43:28,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:43:28,419 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:43:28,426 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-37.i[916,929] [2025-03-08 15:43:28,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:43:28,519 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:43:28,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28 WrapperNode [2025-03-08 15:43:28,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:43:28,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:43:28,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:43:28,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:43:28,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,608 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 734 [2025-03-08 15:43:28,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:43:28,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:43:28,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:43:28,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:43:28,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,707 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:43:28,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:43:28,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:43:28,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:43:28,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:43:28,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:43:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:28,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:43:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:43:28,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:43:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:43:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:43:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:43:28,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:43:28,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:43:28,929 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:43:28,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:43:29,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc property_#t~ite59#1;havoc property_#t~bitwise57#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~ite63#1;havoc property_#t~bitwise61#1;havoc property_#t~short62#1;havoc property_#t~short64#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short68#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short71#1; [2025-03-08 15:43:29,896 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-08 15:43:29,896 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:43:29,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:43:29,927 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:43:29,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:43:29 BoogieIcfgContainer [2025-03-08 15:43:29,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:43:29,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:43:29,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:43:29,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:43:29,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:43:28" (1/3) ... [2025-03-08 15:43:29,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67778a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:43:29, skipping insertion in model container [2025-03-08 15:43:29,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28" (2/3) ... [2025-03-08 15:43:29,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67778a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:43:29, skipping insertion in model container [2025-03-08 15:43:29,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:43:29" (3/3) ... [2025-03-08 15:43:29,939 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-37.i [2025-03-08 15:43:29,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:43:29,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-37.i that has 2 procedures, 307 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:43:30,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:43:30,023 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;@554e78dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:43:30,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:43:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 225 states have (on average 1.52) internal successors, (342), 226 states have internal predecessors, (342), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 15:43:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-08 15:43:30,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:30,056 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:30,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:30,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 241639533, now seen corresponding path program 1 times [2025-03-08 15:43:30,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:30,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954022081] [2025-03-08 15:43:30,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:30,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 15:43:30,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 15:43:30,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:30,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954022081] [2025-03-08 15:43:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954022081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:30,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361818390] [2025-03-08 15:43:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:30,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:30,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:30,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:30,948 INFO L87 Difference]: Start difference. First operand has 307 states, 225 states have (on average 1.52) internal successors, (342), 226 states have internal predecessors, (342), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:31,164 INFO L93 Difference]: Finished difference Result 897 states and 1625 transitions. [2025-03-08 15:43:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:31,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 528 [2025-03-08 15:43:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:31,182 INFO L225 Difference]: With dead ends: 897 [2025-03-08 15:43:31,183 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 15:43:31,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:31,193 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 460 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:31,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1177 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 15:43:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 389. [2025-03-08 15:43:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 308 states have (on average 1.5649350649350648) internal successors, (482), 308 states have internal predecessors, (482), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 15:43:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 640 transitions. [2025-03-08 15:43:31,300 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 640 transitions. Word has length 528 [2025-03-08 15:43:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:31,304 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 640 transitions. [2025-03-08 15:43:31,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 640 transitions. [2025-03-08 15:43:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 15:43:31,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:31,319 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:31,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 15:43:31,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:31,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1272475145, now seen corresponding path program 1 times [2025-03-08 15:43:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290448346] [2025-03-08 15:43:31,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:31,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 15:43:31,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 15:43:31,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:31,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:31,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:31,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290448346] [2025-03-08 15:43:31,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290448346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:31,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:31,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:31,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088149143] [2025-03-08 15:43:31,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:31,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:31,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:31,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:31,778 INFO L87 Difference]: Start difference. First operand 389 states and 640 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:31,928 INFO L93 Difference]: Finished difference Result 1103 states and 1818 transitions. [2025-03-08 15:43:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:31,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 529 [2025-03-08 15:43:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:31,935 INFO L225 Difference]: With dead ends: 1103 [2025-03-08 15:43:31,935 INFO L226 Difference]: Without dead ends: 717 [2025-03-08 15:43:31,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:31,938 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 361 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:31,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1083 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-08 15:43:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 714. [2025-03-08 15:43:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 579 states have (on average 1.5734024179620034) internal successors, (911), 580 states have internal predecessors, (911), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 15:43:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1175 transitions. [2025-03-08 15:43:31,990 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1175 transitions. Word has length 529 [2025-03-08 15:43:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:31,990 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1175 transitions. [2025-03-08 15:43:31,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1175 transitions. [2025-03-08 15:43:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-08 15:43:31,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:31,997 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:31,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:43:31,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:31,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash 349791562, now seen corresponding path program 1 times [2025-03-08 15:43:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:31,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026069809] [2025-03-08 15:43:31,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-08 15:43:32,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-08 15:43:32,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:32,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:32,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026069809] [2025-03-08 15:43:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026069809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:32,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:32,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:32,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519343350] [2025-03-08 15:43:32,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:32,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:32,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:32,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:32,408 INFO L87 Difference]: Start difference. First operand 714 states and 1175 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:32,547 INFO L93 Difference]: Finished difference Result 2080 states and 3417 transitions. [2025-03-08 15:43:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 529 [2025-03-08 15:43:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:32,563 INFO L225 Difference]: With dead ends: 2080 [2025-03-08 15:43:32,563 INFO L226 Difference]: Without dead ends: 1369 [2025-03-08 15:43:32,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:32,566 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 461 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:32,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 934 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-03-08 15:43:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 994. [2025-03-08 15:43:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 859 states have (on average 1.60069848661234) internal successors, (1375), 860 states have internal predecessors, (1375), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 15:43:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1639 transitions. [2025-03-08 15:43:32,647 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1639 transitions. Word has length 529 [2025-03-08 15:43:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1639 transitions. [2025-03-08 15:43:32,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1639 transitions. [2025-03-08 15:43:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-08 15:43:32,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:32,659 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:32,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:43:32,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:32,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -811136128, now seen corresponding path program 1 times [2025-03-08 15:43:32,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:32,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567538920] [2025-03-08 15:43:32,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:32,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-08 15:43:32,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-08 15:43:32,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:32,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:32,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567538920] [2025-03-08 15:43:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567538920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:32,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:32,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870011575] [2025-03-08 15:43:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:32,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:32,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:32,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:32,973 INFO L87 Difference]: Start difference. First operand 994 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:33,151 INFO L93 Difference]: Finished difference Result 2963 states and 4885 transitions. [2025-03-08 15:43:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-08 15:43:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:33,164 INFO L225 Difference]: With dead ends: 2963 [2025-03-08 15:43:33,164 INFO L226 Difference]: Without dead ends: 1972 [2025-03-08 15:43:33,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:33,168 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 431 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:33,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1271 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2025-03-08 15:43:33,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1646. [2025-03-08 15:43:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1511 states have (on average 1.626075446724024) internal successors, (2457), 1512 states have internal predecessors, (2457), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 15:43:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2721 transitions. [2025-03-08 15:43:33,266 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2721 transitions. Word has length 530 [2025-03-08 15:43:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:33,268 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2721 transitions. [2025-03-08 15:43:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2721 transitions. [2025-03-08 15:43:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-08 15:43:33,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:33,278 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:33,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:43:33,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:33,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash -580029889, now seen corresponding path program 1 times [2025-03-08 15:43:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:33,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394726788] [2025-03-08 15:43:33,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:33,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-08 15:43:33,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-08 15:43:33,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:33,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:36,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:36,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394726788] [2025-03-08 15:43:36,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394726788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:36,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:36,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735673818] [2025-03-08 15:43:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:36,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:36,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:36,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:36,924 INFO L87 Difference]: Start difference. First operand 1646 states and 2721 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:37,504 INFO L93 Difference]: Finished difference Result 3305 states and 5457 transitions. [2025-03-08 15:43:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:37,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-08 15:43:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:37,515 INFO L225 Difference]: With dead ends: 3305 [2025-03-08 15:43:37,515 INFO L226 Difference]: Without dead ends: 1662 [2025-03-08 15:43:37,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:37,519 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 208 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:37,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 862 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:43:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-03-08 15:43:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1661. [2025-03-08 15:43:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1520 states have (on average 1.6171052631578948) internal successors, (2458), 1522 states have internal predecessors, (2458), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 15:43:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2730 transitions. [2025-03-08 15:43:37,590 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2730 transitions. Word has length 530 [2025-03-08 15:43:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2730 transitions. [2025-03-08 15:43:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2730 transitions. [2025-03-08 15:43:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-08 15:43:37,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:37,600 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:43:37,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1533998332, now seen corresponding path program 1 times [2025-03-08 15:43:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14920693] [2025-03-08 15:43:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:37,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-08 15:43:37,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-08 15:43:37,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:37,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:38,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14920693] [2025-03-08 15:43:38,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14920693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:38,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:38,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811969336] [2025-03-08 15:43:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:38,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:38,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:38,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:38,205 INFO L87 Difference]: Start difference. First operand 1661 states and 2730 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:38,581 INFO L93 Difference]: Finished difference Result 4860 states and 8005 transitions. [2025-03-08 15:43:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 531 [2025-03-08 15:43:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:38,595 INFO L225 Difference]: With dead ends: 4860 [2025-03-08 15:43:38,595 INFO L226 Difference]: Without dead ends: 3209 [2025-03-08 15:43:38,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:38,600 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 421 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:38,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1420 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2025-03-08 15:43:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3151. [2025-03-08 15:43:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3151 states, 2934 states have (on average 1.630879345603272) internal successors, (4785), 2935 states have internal predecessors, (4785), 211 states have call successors, (211), 5 states have call predecessors, (211), 5 states have return successors, (211), 210 states have call predecessors, (211), 211 states have call successors, (211) [2025-03-08 15:43:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 5207 transitions. [2025-03-08 15:43:38,693 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 5207 transitions. Word has length 531 [2025-03-08 15:43:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:38,693 INFO L471 AbstractCegarLoop]: Abstraction has 3151 states and 5207 transitions. [2025-03-08 15:43:38,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 5207 transitions. [2025-03-08 15:43:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 15:43:38,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:38,701 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:38,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:43:38,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:38,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash -11530095, now seen corresponding path program 1 times [2025-03-08 15:43:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382627737] [2025-03-08 15:43:38,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:38,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 15:43:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 15:43:38,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382627737] [2025-03-08 15:43:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382627737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361713188] [2025-03-08 15:43:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:40,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:40,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:40,042 INFO L87 Difference]: Start difference. First operand 3151 states and 5207 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:40,657 INFO L93 Difference]: Finished difference Result 10506 states and 17440 transitions. [2025-03-08 15:43:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 532 [2025-03-08 15:43:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:40,683 INFO L225 Difference]: With dead ends: 10506 [2025-03-08 15:43:40,684 INFO L226 Difference]: Without dead ends: 8189 [2025-03-08 15:43:40,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:40,692 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 580 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:40,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1735 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:43:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2025-03-08 15:43:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 5729. [2025-03-08 15:43:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5729 states, 5505 states have (on average 1.6457765667574933) internal successors, (9060), 5508 states have internal predecessors, (9060), 215 states have call successors, (215), 8 states have call predecessors, (215), 8 states have return successors, (215), 212 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-08 15:43:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 9490 transitions. [2025-03-08 15:43:40,871 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 9490 transitions. Word has length 532 [2025-03-08 15:43:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 5729 states and 9490 transitions. [2025-03-08 15:43:40,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 9490 transitions. [2025-03-08 15:43:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-08 15:43:40,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:40,879 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:40,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:43:40,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:40,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1959409362, now seen corresponding path program 1 times [2025-03-08 15:43:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:40,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365527179] [2025-03-08 15:43:40,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-08 15:43:41,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-08 15:43:41,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:41,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365527179] [2025-03-08 15:43:41,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365527179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:41,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:41,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124504302] [2025-03-08 15:43:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:41,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:41,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:41,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:41,689 INFO L87 Difference]: Start difference. First operand 5729 states and 9490 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:42,186 INFO L93 Difference]: Finished difference Result 13142 states and 21672 transitions. [2025-03-08 15:43:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:43:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 532 [2025-03-08 15:43:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:42,220 INFO L225 Difference]: With dead ends: 13142 [2025-03-08 15:43:42,220 INFO L226 Difference]: Without dead ends: 7564 [2025-03-08 15:43:42,232 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-08 15:43:42,233 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 983 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:42,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 2767 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2025-03-08 15:43:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 5730. [2025-03-08 15:43:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5730 states, 5506 states have (on average 1.6456592807845987) internal successors, (9061), 5509 states have internal predecessors, (9061), 215 states have call successors, (215), 8 states have call predecessors, (215), 8 states have return successors, (215), 212 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-08 15:43:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 9491 transitions. [2025-03-08 15:43:42,405 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 9491 transitions. Word has length 532 [2025-03-08 15:43:42,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:42,407 INFO L471 AbstractCegarLoop]: Abstraction has 5730 states and 9491 transitions. [2025-03-08 15:43:42,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 9491 transitions. [2025-03-08 15:43:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 15:43:42,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:42,419 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:42,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:43:42,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:42,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:42,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1860846686, now seen corresponding path program 1 times [2025-03-08 15:43:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:42,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693073919] [2025-03-08 15:43:42,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:42,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:43:42,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:43:42,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:42,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693073919] [2025-03-08 15:43:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693073919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:43:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125352814] [2025-03-08 15:43:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:43,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:43:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:43,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:43:43,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:43,387 INFO L87 Difference]: Start difference. First operand 5730 states and 9491 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:44,127 INFO L93 Difference]: Finished difference Result 12595 states and 20859 transitions. [2025-03-08 15:43:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:43:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 15:43:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:44,144 INFO L225 Difference]: With dead ends: 12595 [2025-03-08 15:43:44,144 INFO L226 Difference]: Without dead ends: 7013 [2025-03-08 15:43:44,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:43:44,156 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 842 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:44,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2007 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:43:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2025-03-08 15:43:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5734. [2025-03-08 15:43:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5734 states, 5510 states have (on average 1.645372050816697) internal successors, (9066), 5513 states have internal predecessors, (9066), 215 states have call successors, (215), 8 states have call predecessors, (215), 8 states have return successors, (215), 212 states have call predecessors, (215), 215 states have call successors, (215) [2025-03-08 15:43:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 9496 transitions. [2025-03-08 15:43:44,382 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 9496 transitions. Word has length 533 [2025-03-08 15:43:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 5734 states and 9496 transitions. [2025-03-08 15:43:44,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 9496 transitions. [2025-03-08 15:43:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 15:43:44,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:44,393 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:44,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:43:44,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:44,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2012835166, now seen corresponding path program 1 times [2025-03-08 15:43:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612204908] [2025-03-08 15:43:44,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:44,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:43:44,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:43:44,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:44,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:45,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612204908] [2025-03-08 15:43:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612204908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310838742] [2025-03-08 15:43:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:45,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:45,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:45,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:45,383 INFO L87 Difference]: Start difference. First operand 5734 states and 9496 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:45,897 INFO L93 Difference]: Finished difference Result 15463 states and 25500 transitions. [2025-03-08 15:43:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 15:43:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:45,921 INFO L225 Difference]: With dead ends: 15463 [2025-03-08 15:43:45,921 INFO L226 Difference]: Without dead ends: 10822 [2025-03-08 15:43:45,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:45,934 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 848 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:45,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1331 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:43:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10822 states. [2025-03-08 15:43:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10822 to 9666. [2025-03-08 15:43:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9666 states, 9334 states have (on average 1.643668309406471) internal successors, (15342), 9341 states have internal predecessors, (15342), 317 states have call successors, (317), 14 states have call predecessors, (317), 14 states have return successors, (317), 310 states have call predecessors, (317), 317 states have call successors, (317) [2025-03-08 15:43:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9666 states to 9666 states and 15976 transitions. [2025-03-08 15:43:46,177 INFO L78 Accepts]: Start accepts. Automaton has 9666 states and 15976 transitions. Word has length 533 [2025-03-08 15:43:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:46,178 INFO L471 AbstractCegarLoop]: Abstraction has 9666 states and 15976 transitions. [2025-03-08 15:43:46,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9666 states and 15976 transitions. [2025-03-08 15:43:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 15:43:46,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:46,188 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:46,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:43:46,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:46,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:46,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1900624146, now seen corresponding path program 1 times [2025-03-08 15:43:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820771408] [2025-03-08 15:43:46,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:46,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:43:46,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:43:46,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:46,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820771408] [2025-03-08 15:43:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820771408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:46,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:46,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:43:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015570380] [2025-03-08 15:43:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:43:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:46,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:43:46,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:46,509 INFO L87 Difference]: Start difference. First operand 9666 states and 15976 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:47,117 INFO L93 Difference]: Finished difference Result 20621 states and 34083 transitions. [2025-03-08 15:43:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:43:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 15:43:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:47,141 INFO L225 Difference]: With dead ends: 20621 [2025-03-08 15:43:47,142 INFO L226 Difference]: Without dead ends: 11292 [2025-03-08 15:43:47,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:43:47,158 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1145 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:47,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2178 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:43:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11292 states. [2025-03-08 15:43:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11292 to 9666. [2025-03-08 15:43:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9666 states, 9334 states have (on average 1.642811227769445) internal successors, (15334), 9341 states have internal predecessors, (15334), 317 states have call successors, (317), 14 states have call predecessors, (317), 14 states have return successors, (317), 310 states have call predecessors, (317), 317 states have call successors, (317) [2025-03-08 15:43:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9666 states to 9666 states and 15968 transitions. [2025-03-08 15:43:47,415 INFO L78 Accepts]: Start accepts. Automaton has 9666 states and 15968 transitions. Word has length 533 [2025-03-08 15:43:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:47,416 INFO L471 AbstractCegarLoop]: Abstraction has 9666 states and 15968 transitions. [2025-03-08 15:43:47,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9666 states and 15968 transitions. [2025-03-08 15:43:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 15:43:47,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:47,425 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:47,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:43:47,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 92776625, now seen corresponding path program 1 times [2025-03-08 15:43:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:47,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171235727] [2025-03-08 15:43:47,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:47,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:43:47,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:43:47,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:47,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:43:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171235727] [2025-03-08 15:43:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171235727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809277195] [2025-03-08 15:43:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:48,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:48,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:48,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:48,102 INFO L87 Difference]: Start difference. First operand 9666 states and 15968 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:48,669 INFO L93 Difference]: Finished difference Result 19174 states and 31327 transitions. [2025-03-08 15:43:48,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:43:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 15:43:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:48,695 INFO L225 Difference]: With dead ends: 19174 [2025-03-08 15:43:48,695 INFO L226 Difference]: Without dead ends: 11929 [2025-03-08 15:43:48,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:43:48,708 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 1259 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:48,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 3176 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11929 states. [2025-03-08 15:43:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11929 to 9662. [2025-03-08 15:43:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9662 states, 9330 states have (on average 1.642229367631297) internal successors, (15322), 9337 states have internal predecessors, (15322), 317 states have call successors, (317), 14 states have call predecessors, (317), 14 states have return successors, (317), 310 states have call predecessors, (317), 317 states have call successors, (317) [2025-03-08 15:43:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9662 states to 9662 states and 15956 transitions. [2025-03-08 15:43:48,942 INFO L78 Accepts]: Start accepts. Automaton has 9662 states and 15956 transitions. Word has length 533 [2025-03-08 15:43:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 9662 states and 15956 transitions. [2025-03-08 15:43:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:43:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9662 states and 15956 transitions. [2025-03-08 15:43:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 15:43:48,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:48,954 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:48,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:43:48,954 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:48,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1116297007, now seen corresponding path program 1 times [2025-03-08 15:43:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31133504] [2025-03-08 15:43:48,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:48,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:43:50,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:43:50,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:50,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 120 proven. 114 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:43:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31133504] [2025-03-08 15:43:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31133504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:43:50,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564092752] [2025-03-08 15:43:50,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:50,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:50,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:50,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:43:50,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:43:50,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 15:43:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 15:43:50,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:50,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 15:43:50,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:43:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 1356 proven. 444 refuted. 0 times theorem prover too weak. 10524 trivial. 0 not checked. [2025-03-08 15:43:52,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:43:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 18 proven. 447 refuted. 0 times theorem prover too weak. 11859 trivial. 0 not checked. [2025-03-08 15:43:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564092752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:43:52,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:43:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2025-03-08 15:43:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76661402] [2025-03-08 15:43:52,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:43:52,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:43:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:52,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:43:52,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:43:52,599 INFO L87 Difference]: Start difference. First operand 9662 states and 15956 transitions. Second operand has 16 states, 16 states have (on average 20.375) internal successors, (326), 16 states have internal predecessors, (326), 6 states have call successors, (234), 3 states have call predecessors, (234), 7 states have return successors, (235), 6 states have call predecessors, (235), 6 states have call successors, (235) [2025-03-08 15:43:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:53,895 INFO L93 Difference]: Finished difference Result 14219 states and 23328 transitions. [2025-03-08 15:43:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 15:43:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 20.375) internal successors, (326), 16 states have internal predecessors, (326), 6 states have call successors, (234), 3 states have call predecessors, (234), 7 states have return successors, (235), 6 states have call predecessors, (235), 6 states have call successors, (235) Word has length 533 [2025-03-08 15:43:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:53,910 INFO L225 Difference]: With dead ends: 14219 [2025-03-08 15:43:53,910 INFO L226 Difference]: Without dead ends: 5593 [2025-03-08 15:43:53,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1061 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=432, Invalid=1050, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 15:43:53,921 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1656 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:53,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 1830 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:43:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5593 states. [2025-03-08 15:43:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5593 to 5369. [2025-03-08 15:43:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 5034 states have (on average 1.6074692093762415) internal successors, (8092), 5037 states have internal predecessors, (8092), 309 states have call successors, (309), 25 states have call predecessors, (309), 25 states have return successors, (309), 306 states have call predecessors, (309), 309 states have call successors, (309) [2025-03-08 15:43:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 8710 transitions. [2025-03-08 15:43:54,095 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 8710 transitions. Word has length 533 [2025-03-08 15:43:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:54,096 INFO L471 AbstractCegarLoop]: Abstraction has 5369 states and 8710 transitions. [2025-03-08 15:43:54,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.375) internal successors, (326), 16 states have internal predecessors, (326), 6 states have call successors, (234), 3 states have call predecessors, (234), 7 states have return successors, (235), 6 states have call predecessors, (235), 6 states have call successors, (235) [2025-03-08 15:43:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 8710 transitions. [2025-03-08 15:43:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 15:43:54,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:54,103 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:54,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:43:54,306 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,SelfDestructingSolverStorable12 [2025-03-08 15:43:54,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:54,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1508986095, now seen corresponding path program 1 times [2025-03-08 15:43:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13666044] [2025-03-08 15:43:54,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 15:43:56,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 15:43:56,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:56,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 108 proven. 126 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:43:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13666044] [2025-03-08 15:43:57,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13666044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:43:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546750297] [2025-03-08 15:43:57,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:57,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:43:57,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:43:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 15:43:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 15:43:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:57,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 1246 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:43:57,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:43:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 5484 proven. 75 refuted. 0 times theorem prover too weak. 6765 trivial. 0 not checked. [2025-03-08 15:43:57,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:43:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 159 proven. 75 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:43:58,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546750297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:43:58,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:43:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-08 15:43:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475497041] [2025-03-08 15:43:58,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:43:58,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:43:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:58,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:43:58,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:43:58,004 INFO L87 Difference]: Start difference. First operand 5369 states and 8710 transitions. Second operand has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 states have internal predecessors, (263), 4 states have call successors, (183), 2 states have call predecessors, (183), 4 states have return successors, (184), 4 states have call predecessors, (184), 4 states have call successors, (184) [2025-03-08 15:43:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:59,138 INFO L93 Difference]: Finished difference Result 9561 states and 15548 transitions. [2025-03-08 15:43:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 15:43:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 states have internal predecessors, (263), 4 states have call successors, (183), 2 states have call predecessors, (183), 4 states have return successors, (184), 4 states have call predecessors, (184), 4 states have call successors, (184) Word has length 535 [2025-03-08 15:43:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:59,151 INFO L225 Difference]: With dead ends: 9561 [2025-03-08 15:43:59,152 INFO L226 Difference]: Without dead ends: 5146 [2025-03-08 15:43:59,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 1068 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2025-03-08 15:43:59,160 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1800 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:59,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 1640 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:43:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2025-03-08 15:43:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 4460. [2025-03-08 15:43:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 4093 states have (on average 1.5817248961641828) internal successors, (6474), 4095 states have internal predecessors, (6474), 335 states have call successors, (335), 31 states have call predecessors, (335), 31 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-08 15:43:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 7144 transitions. [2025-03-08 15:43:59,343 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 7144 transitions. Word has length 535 [2025-03-08 15:43:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:59,345 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 7144 transitions. [2025-03-08 15:43:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.22222222222222) internal successors, (263), 9 states have internal predecessors, (263), 4 states have call successors, (183), 2 states have call predecessors, (183), 4 states have return successors, (184), 4 states have call predecessors, (184), 4 states have call successors, (184) [2025-03-08 15:43:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 7144 transitions. [2025-03-08 15:43:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:43:59,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:59,351 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:59,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:43:59,551 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-08 15:43:59,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:59,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1759797960, now seen corresponding path program 1 times [2025-03-08 15:43:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915566749] [2025-03-08 15:43:59,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:59,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:43:59,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:43:59,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:59,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:00,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:00,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915566749] [2025-03-08 15:44:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915566749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:00,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:00,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:00,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548555644] [2025-03-08 15:44:00,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:00,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:00,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:00,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:00,024 INFO L87 Difference]: Start difference. First operand 4460 states and 7144 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:00,678 INFO L93 Difference]: Finished difference Result 10408 states and 16628 transitions. [2025-03-08 15:44:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:00,701 INFO L225 Difference]: With dead ends: 10408 [2025-03-08 15:44:00,701 INFO L226 Difference]: Without dead ends: 7068 [2025-03-08 15:44:00,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:00,709 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 866 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:00,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1372 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:44:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7068 states. [2025-03-08 15:44:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7068 to 6608. [2025-03-08 15:44:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6608 states, 6238 states have (on average 1.5851234369990381) internal successors, (9888), 6240 states have internal predecessors, (9888), 335 states have call successors, (335), 34 states have call predecessors, (335), 34 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-08 15:44:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6608 states to 6608 states and 10558 transitions. [2025-03-08 15:44:00,972 INFO L78 Accepts]: Start accepts. Automaton has 6608 states and 10558 transitions. Word has length 537 [2025-03-08 15:44:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 6608 states and 10558 transitions. [2025-03-08 15:44:00,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 10558 transitions. [2025-03-08 15:44:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:00,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:00,984 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:44:00,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:00,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash 804276681, now seen corresponding path program 1 times [2025-03-08 15:44:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493813266] [2025-03-08 15:44:00,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:01,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:01,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:01,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493813266] [2025-03-08 15:44:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493813266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146160599] [2025-03-08 15:44:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:01,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:01,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:01,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:01,452 INFO L87 Difference]: Start difference. First operand 6608 states and 10558 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:02,211 INFO L93 Difference]: Finished difference Result 12420 states and 19618 transitions. [2025-03-08 15:44:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:02,227 INFO L225 Difference]: With dead ends: 12420 [2025-03-08 15:44:02,228 INFO L226 Difference]: Without dead ends: 7028 [2025-03-08 15:44:02,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:02,236 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 947 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:02,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1435 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:44:02,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2025-03-08 15:44:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 4650. [2025-03-08 15:44:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4650 states, 4280 states have (on average 1.5387850467289719) internal successors, (6586), 4282 states have internal predecessors, (6586), 335 states have call successors, (335), 34 states have call predecessors, (335), 34 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-08 15:44:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 7256 transitions. [2025-03-08 15:44:02,440 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 7256 transitions. Word has length 537 [2025-03-08 15:44:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:02,441 INFO L471 AbstractCegarLoop]: Abstraction has 4650 states and 7256 transitions. [2025-03-08 15:44:02,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 7256 transitions. [2025-03-08 15:44:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:02,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:02,445 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:02,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:44:02,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -304237988, now seen corresponding path program 1 times [2025-03-08 15:44:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510087716] [2025-03-08 15:44:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:02,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:02,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:02,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:02,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510087716] [2025-03-08 15:44:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510087716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091253947] [2025-03-08 15:44:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:03,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:03,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:03,588 INFO L87 Difference]: Start difference. First operand 4650 states and 7256 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:05,197 INFO L93 Difference]: Finished difference Result 10688 states and 16624 transitions. [2025-03-08 15:44:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:44:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:05,211 INFO L225 Difference]: With dead ends: 10688 [2025-03-08 15:44:05,211 INFO L226 Difference]: Without dead ends: 6800 [2025-03-08 15:44:05,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:44:05,217 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1288 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:05,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 2532 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:44:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2025-03-08 15:44:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 4650. [2025-03-08 15:44:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4650 states, 4280 states have (on average 1.535981308411215) internal successors, (6574), 4282 states have internal predecessors, (6574), 335 states have call successors, (335), 34 states have call predecessors, (335), 34 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-08 15:44:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 7244 transitions. [2025-03-08 15:44:05,375 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 7244 transitions. Word has length 537 [2025-03-08 15:44:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:05,376 INFO L471 AbstractCegarLoop]: Abstraction has 4650 states and 7244 transitions. [2025-03-08 15:44:05,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 7244 transitions. [2025-03-08 15:44:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:05,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:05,381 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:05,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:44:05,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:05,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash 665343035, now seen corresponding path program 1 times [2025-03-08 15:44:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:05,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440539071] [2025-03-08 15:44:05,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:05,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:05,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:05,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:05,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440539071] [2025-03-08 15:44:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440539071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430798079] [2025-03-08 15:44:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:06,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:06,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:06,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:06,046 INFO L87 Difference]: Start difference. First operand 4650 states and 7244 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:06,622 INFO L93 Difference]: Finished difference Result 14616 states and 22730 transitions. [2025-03-08 15:44:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:06,640 INFO L225 Difference]: With dead ends: 14616 [2025-03-08 15:44:06,640 INFO L226 Difference]: Without dead ends: 10930 [2025-03-08 15:44:06,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:06,647 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 784 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:06,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1339 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10930 states. [2025-03-08 15:44:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10930 to 4698. [2025-03-08 15:44:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4698 states, 4328 states have (on average 1.5355822550831792) internal successors, (6646), 4330 states have internal predecessors, (6646), 335 states have call successors, (335), 34 states have call predecessors, (335), 34 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-08 15:44:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 7316 transitions. [2025-03-08 15:44:06,846 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 7316 transitions. Word has length 537 [2025-03-08 15:44:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:06,847 INFO L471 AbstractCegarLoop]: Abstraction has 4698 states and 7316 transitions. [2025-03-08 15:44:06,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 7316 transitions. [2025-03-08 15:44:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:06,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:06,851 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:44:06,851 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -819712516, now seen corresponding path program 1 times [2025-03-08 15:44:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934426697] [2025-03-08 15:44:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:06,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:06,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:06,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:06,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:06,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934426697] [2025-03-08 15:44:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934426697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:06,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:06,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:44:06,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247944881] [2025-03-08 15:44:06,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:44:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:06,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:44:06,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:06,980 INFO L87 Difference]: Start difference. First operand 4698 states and 7316 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:07,274 INFO L93 Difference]: Finished difference Result 10209 states and 15844 transitions. [2025-03-08 15:44:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:44:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:07,286 INFO L225 Difference]: With dead ends: 10209 [2025-03-08 15:44:07,286 INFO L226 Difference]: Without dead ends: 6308 [2025-03-08 15:44:07,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:44:07,291 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 457 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:07,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1025 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:44:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2025-03-08 15:44:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 4689. [2025-03-08 15:44:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4319 states have (on average 1.5216485297522575) internal successors, (6572), 4321 states have internal predecessors, (6572), 335 states have call successors, (335), 34 states have call predecessors, (335), 34 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-08 15:44:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 7242 transitions. [2025-03-08 15:44:07,472 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 7242 transitions. Word has length 537 [2025-03-08 15:44:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:07,472 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 7242 transitions. [2025-03-08 15:44:07,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 7242 transitions. [2025-03-08 15:44:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:07,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:07,477 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:07,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:44:07,477 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:07,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1549700930, now seen corresponding path program 1 times [2025-03-08 15:44:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:07,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939447845] [2025-03-08 15:44:07,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:07,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:08,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:08,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:08,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 102 proven. 132 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:44:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939447845] [2025-03-08 15:44:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939447845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917468] [2025-03-08 15:44:08,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:08,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:08,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:08,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:08,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:44:09,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:09,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:09,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:09,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:09,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:44:09,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 7470 proven. 315 refuted. 0 times theorem prover too weak. 4539 trivial. 0 not checked. [2025-03-08 15:44:10,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:44:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 147 proven. 318 refuted. 0 times theorem prover too weak. 11859 trivial. 0 not checked. [2025-03-08 15:44:11,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:44:11,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:44:11,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 25 [2025-03-08 15:44:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79335673] [2025-03-08 15:44:11,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:44:11,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 15:44:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:11,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 15:44:11,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:44:11,571 INFO L87 Difference]: Start difference. First operand 4689 states and 7242 transitions. Second operand has 25 states, 25 states have (on average 16.08) internal successors, (402), 25 states have internal predecessors, (402), 10 states have call successors, (233), 5 states have call predecessors, (233), 10 states have return successors, (233), 10 states have call predecessors, (233), 10 states have call successors, (233) [2025-03-08 15:44:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:15,788 INFO L93 Difference]: Finished difference Result 18422 states and 28217 transitions. [2025-03-08 15:44:15,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-08 15:44:15,789 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 16.08) internal successors, (402), 25 states have internal predecessors, (402), 10 states have call successors, (233), 5 states have call predecessors, (233), 10 states have return successors, (233), 10 states have call predecessors, (233), 10 states have call successors, (233) Word has length 537 [2025-03-08 15:44:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:15,813 INFO L225 Difference]: With dead ends: 18422 [2025-03-08 15:44:15,813 INFO L226 Difference]: Without dead ends: 14623 [2025-03-08 15:44:15,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1067 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2143, Invalid=6977, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 15:44:15,824 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 4682 mSDsluCounter, 3240 mSDsCounter, 0 mSdLazyCounter, 4447 mSolverCounterSat, 1121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 3963 SdHoareTripleChecker+Invalid, 5568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1121 IncrementalHoareTripleChecker+Valid, 4447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:15,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 3963 Invalid, 5568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1121 Valid, 4447 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 15:44:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14623 states. [2025-03-08 15:44:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14623 to 14401. [2025-03-08 15:44:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14401 states, 13073 states have (on average 1.50340396236518) internal successors, (19654), 13095 states have internal predecessors, (19654), 1131 states have call successors, (1131), 196 states have call predecessors, (1131), 196 states have return successors, (1131), 1109 states have call predecessors, (1131), 1131 states have call successors, (1131) [2025-03-08 15:44:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 21916 transitions. [2025-03-08 15:44:16,570 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 21916 transitions. Word has length 537 [2025-03-08 15:44:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:16,571 INFO L471 AbstractCegarLoop]: Abstraction has 14401 states and 21916 transitions. [2025-03-08 15:44:16,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 16.08) internal successors, (402), 25 states have internal predecessors, (402), 10 states have call successors, (233), 5 states have call predecessors, (233), 10 states have return successors, (233), 10 states have call predecessors, (233), 10 states have call successors, (233) [2025-03-08 15:44:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 21916 transitions. [2025-03-08 15:44:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:16,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:16,579 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:16,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:44:16,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:16,780 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:16,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash 702189341, now seen corresponding path program 1 times [2025-03-08 15:44:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938605098] [2025-03-08 15:44:16,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:16,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:16,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:16,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:16,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:17,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938605098] [2025-03-08 15:44:17,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938605098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:17,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:17,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:17,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816406511] [2025-03-08 15:44:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:17,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:17,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:17,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:17,320 INFO L87 Difference]: Start difference. First operand 14401 states and 21916 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:18,518 INFO L93 Difference]: Finished difference Result 34198 states and 51824 transitions. [2025-03-08 15:44:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:18,560 INFO L225 Difference]: With dead ends: 34198 [2025-03-08 15:44:18,560 INFO L226 Difference]: Without dead ends: 22955 [2025-03-08 15:44:18,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:18,579 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 399 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:18,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1375 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22955 states. [2025-03-08 15:44:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22955 to 22951. [2025-03-08 15:44:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22951 states, 20755 states have (on average 1.4986750180679353) internal successors, (31105), 20793 states have internal predecessors, (31105), 1859 states have call successors, (1859), 336 states have call predecessors, (1859), 336 states have return successors, (1859), 1821 states have call predecessors, (1859), 1859 states have call successors, (1859) [2025-03-08 15:44:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22951 states to 22951 states and 34823 transitions. [2025-03-08 15:44:20,029 INFO L78 Accepts]: Start accepts. Automaton has 22951 states and 34823 transitions. Word has length 537 [2025-03-08 15:44:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 22951 states and 34823 transitions. [2025-03-08 15:44:20,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 22951 states and 34823 transitions. [2025-03-08 15:44:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-08 15:44:20,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:20,043 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 15:44:20,043 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1389329137, now seen corresponding path program 1 times [2025-03-08 15:44:20,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618685489] [2025-03-08 15:44:20,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:20,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-08 15:44:20,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-08 15:44:20,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:20,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 15:44:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618685489] [2025-03-08 15:44:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618685489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596981343] [2025-03-08 15:44:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:20,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:20,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:20,944 INFO L87 Difference]: Start difference. First operand 22951 states and 34823 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:24,508 INFO L93 Difference]: Finished difference Result 55462 states and 82232 transitions. [2025-03-08 15:44:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:44:24,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-03-08 15:44:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:24,577 INFO L225 Difference]: With dead ends: 55462 [2025-03-08 15:44:24,577 INFO L226 Difference]: Without dead ends: 38974 [2025-03-08 15:44:24,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:44:24,598 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 2485 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2485 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:24,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2485 Valid, 2852 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:44:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38974 states. [2025-03-08 15:44:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38974 to 32894. [2025-03-08 15:44:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32894 states, 28637 states have (on average 1.4652023605824633) internal successors, (41959), 28715 states have internal predecessors, (41959), 3595 states have call successors, (3595), 661 states have call predecessors, (3595), 661 states have return successors, (3595), 3517 states have call predecessors, (3595), 3595 states have call successors, (3595) [2025-03-08 15:44:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32894 states to 32894 states and 49149 transitions. [2025-03-08 15:44:26,901 INFO L78 Accepts]: Start accepts. Automaton has 32894 states and 49149 transitions. Word has length 537 [2025-03-08 15:44:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:26,902 INFO L471 AbstractCegarLoop]: Abstraction has 32894 states and 49149 transitions. [2025-03-08 15:44:26,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 15:44:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32894 states and 49149 transitions. [2025-03-08 15:44:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-08 15:44:26,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:26,914 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 15:44:26,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:26,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash -810885713, now seen corresponding path program 1 times [2025-03-08 15:44:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:26,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290170616] [2025-03-08 15:44:26,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:26,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-08 15:44:27,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-08 15:44:27,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:27,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 108 proven. 126 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:44:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290170616] [2025-03-08 15:44:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290170616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610644855] [2025-03-08 15:44:28,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:28,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:28,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:28,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:28,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:44:28,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-08 15:44:28,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-08 15:44:28,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:28,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:28,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:44:28,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6198 proven. 126 refuted. 0 times theorem prover too weak. 6000 trivial. 0 not checked. [2025-03-08 15:44:28,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:44:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 108 proven. 126 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:44:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610644855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:44:29,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:44:29,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:44:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171337458] [2025-03-08 15:44:29,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:44:29,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:44:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:29,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:44:29,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:44:29,121 INFO L87 Difference]: Start difference. First operand 32894 states and 49149 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 3 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (164), 3 states have call predecessors, (164), 3 states have call successors, (164) [2025-03-08 15:44:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:32,148 INFO L93 Difference]: Finished difference Result 46582 states and 69219 transitions. [2025-03-08 15:44:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:44:32,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 3 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (164), 3 states have call predecessors, (164), 3 states have call successors, (164) Word has length 538 [2025-03-08 15:44:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:32,209 INFO L225 Difference]: With dead ends: 46582 [2025-03-08 15:44:32,209 INFO L226 Difference]: Without dead ends: 29488 [2025-03-08 15:44:32,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1082 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:44:32,227 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 277 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:32,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 969 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29488 states. [2025-03-08 15:44:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29488 to 15252. [2025-03-08 15:44:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15252 states, 13061 states have (on average 1.4292167521629278) internal successors, (18667), 13100 states have internal predecessors, (18667), 1837 states have call successors, (1837), 353 states have call predecessors, (1837), 353 states have return successors, (1837), 1798 states have call predecessors, (1837), 1837 states have call successors, (1837) [2025-03-08 15:44:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15252 states to 15252 states and 22341 transitions. [2025-03-08 15:44:33,769 INFO L78 Accepts]: Start accepts. Automaton has 15252 states and 22341 transitions. Word has length 538 [2025-03-08 15:44:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:33,769 INFO L471 AbstractCegarLoop]: Abstraction has 15252 states and 22341 transitions. [2025-03-08 15:44:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 3 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (164), 3 states have call predecessors, (164), 3 states have call successors, (164) [2025-03-08 15:44:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 15252 states and 22341 transitions. [2025-03-08 15:44:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-08 15:44:33,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:33,776 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:33,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:44:33,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:33,977 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1775927209, now seen corresponding path program 1 times [2025-03-08 15:44:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095698102] [2025-03-08 15:44:33,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-08 15:44:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-08 15:44:34,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 102 proven. 132 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:44:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095698102] [2025-03-08 15:44:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095698102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028272140] [2025-03-08 15:44:35,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:35,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:35,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:35,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:35,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:44:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-08 15:44:35,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-08 15:44:35,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:35,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:35,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:44:35,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 4980 proven. 63 refuted. 0 times theorem prover too weak. 7281 trivial. 0 not checked. [2025-03-08 15:44:36,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:44:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 171 proven. 63 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-08 15:44:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028272140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:44:36,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:44:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 18 [2025-03-08 15:44:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916210007] [2025-03-08 15:44:36,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:44:36,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:44:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:36,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:44:36,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:44:36,443 INFO L87 Difference]: Start difference. First operand 15252 states and 22341 transitions. Second operand has 18 states, 18 states have (on average 14.722222222222221) internal successors, (265), 18 states have internal predecessors, (265), 5 states have call successors, (179), 2 states have call predecessors, (179), 4 states have return successors, (180), 5 states have call predecessors, (180), 5 states have call successors, (180)