./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-45.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 e1fa75596dd4a8d087ff959d2eea13841816935af8426327d316b65266b0a5e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:33:11,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:33:11,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:33:11,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:33:11,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:33:12,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:33:12,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:33:12,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:33:12,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:33:12,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:33:12,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:33:12,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:33:12,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:33:12,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:33:12,015 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:33:12,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:33:12,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:33:12,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:33:12,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:33:12,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:33:12,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:33:12,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:33:12,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:33:12,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:33:12,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:33:12,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:33:12,018 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 -> e1fa75596dd4a8d087ff959d2eea13841816935af8426327d316b65266b0a5e8 [2025-03-04 00:33:12,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:33:12,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:33:12,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:33:12,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:33:12,249 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:33:12,250 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-45.i [2025-03-04 00:33:13,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b39734e4/25db7f19788e43018d1d46d588d9af83/FLAGafd2d2e3c [2025-03-04 00:33:13,727 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:33:13,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-45.i [2025-03-04 00:33:13,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b39734e4/25db7f19788e43018d1d46d588d9af83/FLAGafd2d2e3c [2025-03-04 00:33:13,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b39734e4/25db7f19788e43018d1d46d588d9af83 [2025-03-04 00:33:13,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:33:13,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:33:13,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:33:13,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:33:13,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:33:13,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:33:13" (1/1) ... [2025-03-04 00:33:13,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b88f9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:13, skipping insertion in model container [2025-03-04 00:33:13,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:33:13" (1/1) ... [2025-03-04 00:33:13,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:33:13,929 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-45.i[916,929] [2025-03-04 00:33:14,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:33:14,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:33:14,177 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-45.i[916,929] [2025-03-04 00:33:14,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:33:14,302 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:33:14,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14 WrapperNode [2025-03-04 00:33:14,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:33:14,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:33:14,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:33:14,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:33:14,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,411 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 710 [2025-03-04 00:33:14,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:33:14,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:33:14,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:33:14,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:33:14,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:33:14,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:33:14,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:33:14,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:33:14,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:33:14,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (1/1) ... [2025-03-04 00:33:14,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:33:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:14,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:33:14,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:33:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:33:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:33:14,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:33:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:33:14,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:33:14,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:33:14,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:33:14,778 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:33:15,642 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc property_#t~ite47#1;havoc property_#t~bitwise46#1;havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~bitwise50#1;havoc property_#t~bitwise51#1;havoc property_#t~short52#1;havoc property_#t~ite54#1;havoc property_#t~bitwise53#1;havoc property_#t~short55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1; [2025-03-04 00:33:15,777 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-04 00:33:15,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:33:15,807 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:33:15,809 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:33:15,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:33:15 BoogieIcfgContainer [2025-03-04 00:33:15,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:33:15,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:33:15,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:33:15,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:33:15,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:33:13" (1/3) ... [2025-03-04 00:33:15,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681c4da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:33:15, skipping insertion in model container [2025-03-04 00:33:15,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:33:14" (2/3) ... [2025-03-04 00:33:15,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681c4da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:33:15, skipping insertion in model container [2025-03-04 00:33:15,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:33:15" (3/3) ... [2025-03-04 00:33:15,816 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-45.i [2025-03-04 00:33:15,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:33:15,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-45.i that has 2 procedures, 275 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:33:15,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:33:15,893 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;@3c186571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:33:15,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:33:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 209 states have (on average 1.5263157894736843) internal successors, (319), 210 states have internal predecessors, (319), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 00:33:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-04 00:33:15,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:15,923 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:15,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash 591406778, now seen corresponding path program 1 times [2025-03-04 00:33:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:15,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118290408] [2025-03-04 00:33:15,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-04 00:33:16,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-04 00:33:16,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:16,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-04 00:33:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118290408] [2025-03-04 00:33:16,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118290408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:16,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161435210] [2025-03-04 00:33:16,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:16,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:16,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:16,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:33:16,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-04 00:33:16,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-04 00:33:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:16,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:33:16,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-04 00:33:16,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:33:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161435210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:16,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:33:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:33:16,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729458099] [2025-03-04 00:33:16,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:16,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:33:16,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:16,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:33:16,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:33:16,932 INFO L87 Difference]: Start difference. First operand has 275 states, 209 states have (on average 1.5263157894736843) internal successors, (319), 210 states have internal predecessors, (319), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-04 00:33:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:17,015 INFO L93 Difference]: Finished difference Result 544 states and 948 transitions. [2025-03-04 00:33:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:33:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) Word has length 452 [2025-03-04 00:33:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:17,028 INFO L225 Difference]: With dead ends: 544 [2025-03-04 00:33:17,028 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 00:33:17,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:33:17,037 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:17,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:33:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 00:33:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-03-04 00:33:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 207 states have (on average 1.5120772946859904) internal successors, (313), 207 states have internal predecessors, (313), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 00:33:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 439 transitions. [2025-03-04 00:33:17,106 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 439 transitions. Word has length 452 [2025-03-04 00:33:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:17,109 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 439 transitions. [2025-03-04 00:33:17,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-04 00:33:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 439 transitions. [2025-03-04 00:33:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-04 00:33:17,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:17,119 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:17,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:33:17,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:33:17,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:17,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1799575809, now seen corresponding path program 1 times [2025-03-04 00:33:17,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:17,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669204673] [2025-03-04 00:33:17,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:17,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-04 00:33:17,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-04 00:33:17,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:17,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669204673] [2025-03-04 00:33:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669204673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499454016] [2025-03-04 00:33:17,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:17,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:17,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:17,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:17,871 INFO L87 Difference]: Start difference. First operand 272 states and 439 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:18,002 INFO L93 Difference]: Finished difference Result 713 states and 1152 transitions. [2025-03-04 00:33:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 453 [2025-03-04 00:33:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:18,008 INFO L225 Difference]: With dead ends: 713 [2025-03-04 00:33:18,010 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 00:33:18,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:18,012 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 273 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:18,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 876 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 00:33:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2025-03-04 00:33:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 357 states have (on average 1.5406162464985995) internal successors, (550), 358 states have internal predecessors, (550), 81 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-04 00:33:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 712 transitions. [2025-03-04 00:33:18,054 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 712 transitions. Word has length 453 [2025-03-04 00:33:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:18,056 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 712 transitions. [2025-03-04 00:33:18,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 712 transitions. [2025-03-04 00:33:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-04 00:33:18,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:18,062 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:33:18,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:18,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1380058978, now seen corresponding path program 1 times [2025-03-04 00:33:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922070994] [2025-03-04 00:33:18,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:18,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-04 00:33:18,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-04 00:33:18,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:18,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:18,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:18,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922070994] [2025-03-04 00:33:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922070994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:18,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:18,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751596977] [2025-03-04 00:33:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:18,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:18,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:18,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:18,414 INFO L87 Difference]: Start difference. First operand 441 states and 712 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:18,563 INFO L93 Difference]: Finished difference Result 1293 states and 2088 transitions. [2025-03-04 00:33:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:18,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 453 [2025-03-04 00:33:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:18,572 INFO L225 Difference]: With dead ends: 1293 [2025-03-04 00:33:18,574 INFO L226 Difference]: Without dead ends: 855 [2025-03-04 00:33:18,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:18,576 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 406 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:18,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1219 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-04 00:33:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 501. [2025-03-04 00:33:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 417 states have (on average 1.5491606714628297) internal successors, (646), 418 states have internal predecessors, (646), 81 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-04 00:33:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 808 transitions. [2025-03-04 00:33:18,634 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 808 transitions. Word has length 453 [2025-03-04 00:33:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 808 transitions. [2025-03-04 00:33:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 808 transitions. [2025-03-04 00:33:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-04 00:33:18,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:18,642 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:18,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:33:18,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:18,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:18,643 INFO L85 PathProgramCache]: Analyzing trace with hash -87077191, now seen corresponding path program 1 times [2025-03-04 00:33:18,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:18,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961640163] [2025-03-04 00:33:18,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:18,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:18,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-04 00:33:18,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 00:33:18,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:18,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961640163] [2025-03-04 00:33:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961640163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153991467] [2025-03-04 00:33:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:18,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:18,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:18,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:18,938 INFO L87 Difference]: Start difference. First operand 501 states and 808 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:19,055 INFO L93 Difference]: Finished difference Result 1493 states and 2410 transitions. [2025-03-04 00:33:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 454 [2025-03-04 00:33:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:19,066 INFO L225 Difference]: With dead ends: 1493 [2025-03-04 00:33:19,066 INFO L226 Difference]: Without dead ends: 995 [2025-03-04 00:33:19,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:19,069 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 387 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:19,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1093 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:19,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-04 00:33:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 743. [2025-03-04 00:33:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 659 states have (on average 1.5842185128983308) internal successors, (1044), 660 states have internal predecessors, (1044), 81 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-04 00:33:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1206 transitions. [2025-03-04 00:33:19,149 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1206 transitions. Word has length 454 [2025-03-04 00:33:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:19,150 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1206 transitions. [2025-03-04 00:33:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1206 transitions. [2025-03-04 00:33:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-04 00:33:19,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:19,159 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:19,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:33:19,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:19,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1213075769, now seen corresponding path program 1 times [2025-03-04 00:33:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:19,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827362744] [2025-03-04 00:33:19,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-04 00:33:19,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 00:33:19,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827362744] [2025-03-04 00:33:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827362744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:20,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:20,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328172129] [2025-03-04 00:33:20,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:20,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:20,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:20,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:20,193 INFO L87 Difference]: Start difference. First operand 743 states and 1206 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:20,481 INFO L93 Difference]: Finished difference Result 2452 states and 3981 transitions. [2025-03-04 00:33:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 454 [2025-03-04 00:33:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:20,489 INFO L225 Difference]: With dead ends: 2452 [2025-03-04 00:33:20,489 INFO L226 Difference]: Without dead ends: 1712 [2025-03-04 00:33:20,492 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-04 00:33:20,493 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 702 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:20,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1186 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:33:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-04 00:33:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1095. [2025-03-04 00:33:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1011 states have (on average 1.6053412462908012) internal successors, (1623), 1012 states have internal predecessors, (1623), 81 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-04 00:33:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1785 transitions. [2025-03-04 00:33:20,549 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1785 transitions. Word has length 454 [2025-03-04 00:33:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:20,549 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1785 transitions. [2025-03-04 00:33:20,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1785 transitions. [2025-03-04 00:33:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-04 00:33:20,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:20,556 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:20,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:33:20,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:20,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1671328828, now seen corresponding path program 1 times [2025-03-04 00:33:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363860489] [2025-03-04 00:33:20,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:20,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-04 00:33:20,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 00:33:20,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363860489] [2025-03-04 00:33:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363860489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128379123] [2025-03-04 00:33:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:21,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:21,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:21,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:21,261 INFO L87 Difference]: Start difference. First operand 1095 states and 1785 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:21,589 INFO L93 Difference]: Finished difference Result 3545 states and 5778 transitions. [2025-03-04 00:33:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 454 [2025-03-04 00:33:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:21,599 INFO L225 Difference]: With dead ends: 3545 [2025-03-04 00:33:21,599 INFO L226 Difference]: Without dead ends: 2435 [2025-03-04 00:33:21,602 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-04 00:33:21,603 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 613 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:21,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1045 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-03-04 00:33:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1955. [2025-03-04 00:33:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1831 states have (on average 1.5925723648279628) internal successors, (2916), 1834 states have internal predecessors, (2916), 119 states have call successors, (119), 4 states have call predecessors, (119), 4 states have return successors, (119), 116 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-04 00:33:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 3154 transitions. [2025-03-04 00:33:21,667 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 3154 transitions. Word has length 454 [2025-03-04 00:33:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:21,669 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 3154 transitions. [2025-03-04 00:33:21,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 3154 transitions. [2025-03-04 00:33:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-04 00:33:21,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:21,675 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:21,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:33:21,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:21,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 434975128, now seen corresponding path program 1 times [2025-03-04 00:33:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054189288] [2025-03-04 00:33:21,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:21,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-04 00:33:22,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 00:33:22,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:22,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:22,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:22,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054189288] [2025-03-04 00:33:22,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054189288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:22,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:33:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276356215] [2025-03-04 00:33:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:22,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:33:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:22,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:33:22,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:22,705 INFO L87 Difference]: Start difference. First operand 1955 states and 3154 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:23,188 INFO L93 Difference]: Finished difference Result 5252 states and 8471 transitions. [2025-03-04 00:33:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 454 [2025-03-04 00:33:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:23,201 INFO L225 Difference]: With dead ends: 5252 [2025-03-04 00:33:23,201 INFO L226 Difference]: Without dead ends: 3300 [2025-03-04 00:33:23,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:33:23,206 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 377 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:23,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1624 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2025-03-04 00:33:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2067. [2025-03-04 00:33:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1878 states have (on average 1.5782747603833867) internal successors, (2964), 1881 states have internal predecessors, (2964), 182 states have call successors, (182), 6 states have call predecessors, (182), 6 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-04 00:33:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 3328 transitions. [2025-03-04 00:33:23,282 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 3328 transitions. Word has length 454 [2025-03-04 00:33:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:23,282 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 3328 transitions. [2025-03-04 00:33:23,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3328 transitions. [2025-03-04 00:33:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:23,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:23,286 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:33:23,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:23,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1365964325, now seen corresponding path program 1 times [2025-03-04 00:33:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220778624] [2025-03-04 00:33:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:23,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:23,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:23,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:23,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:24,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220778624] [2025-03-04 00:33:24,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220778624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:24,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:24,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:33:24,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597666677] [2025-03-04 00:33:24,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:24,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:33:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:24,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:33:24,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:24,057 INFO L87 Difference]: Start difference. First operand 2067 states and 3328 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:24,763 INFO L93 Difference]: Finished difference Result 6940 states and 11185 transitions. [2025-03-04 00:33:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:33:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:24,781 INFO L225 Difference]: With dead ends: 6940 [2025-03-04 00:33:24,781 INFO L226 Difference]: Without dead ends: 4988 [2025-03-04 00:33:24,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:33:24,788 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 696 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:24,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 2370 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:33:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-03-04 00:33:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4908. [2025-03-04 00:33:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4908 states, 4547 states have (on average 1.5867605014295139) internal successors, (7215), 4556 states have internal predecessors, (7215), 345 states have call successors, (345), 15 states have call predecessors, (345), 15 states have return successors, (345), 336 states have call predecessors, (345), 345 states have call successors, (345) [2025-03-04 00:33:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 7905 transitions. [2025-03-04 00:33:24,923 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 7905 transitions. Word has length 455 [2025-03-04 00:33:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:24,924 INFO L471 AbstractCegarLoop]: Abstraction has 4908 states and 7905 transitions. [2025-03-04 00:33:24,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 7905 transitions. [2025-03-04 00:33:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:24,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:24,930 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:24,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:33:24,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:24,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1824217384, now seen corresponding path program 1 times [2025-03-04 00:33:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137954070] [2025-03-04 00:33:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:24,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:25,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:25,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:25,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:26,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137954070] [2025-03-04 00:33:26,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137954070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:26,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:26,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:26,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352306000] [2025-03-04 00:33:26,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:26,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:26,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:26,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:26,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:26,080 INFO L87 Difference]: Start difference. First operand 4908 states and 7905 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:26,509 INFO L93 Difference]: Finished difference Result 23062 states and 37251 transitions. [2025-03-04 00:33:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:26,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:26,570 INFO L225 Difference]: With dead ends: 23062 [2025-03-04 00:33:26,570 INFO L226 Difference]: Without dead ends: 18269 [2025-03-04 00:33:26,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:26,588 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1083 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:26,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1252 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18269 states. [2025-03-04 00:33:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18269 to 9711. [2025-03-04 00:33:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9711 states, 9055 states have (on average 1.5759249033683047) internal successors, (14270), 9073 states have internal predecessors, (14270), 627 states have call successors, (627), 28 states have call predecessors, (627), 28 states have return successors, (627), 609 states have call predecessors, (627), 627 states have call successors, (627) [2025-03-04 00:33:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9711 states to 9711 states and 15524 transitions. [2025-03-04 00:33:26,932 INFO L78 Accepts]: Start accepts. Automaton has 9711 states and 15524 transitions. Word has length 455 [2025-03-04 00:33:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:26,933 INFO L471 AbstractCegarLoop]: Abstraction has 9711 states and 15524 transitions. [2025-03-04 00:33:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9711 states and 15524 transitions. [2025-03-04 00:33:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:26,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:26,942 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:26,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:33:26,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:26,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1809967239, now seen corresponding path program 1 times [2025-03-04 00:33:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240083915] [2025-03-04 00:33:26,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:26,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:27,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:27,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:27,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240083915] [2025-03-04 00:33:28,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240083915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:28,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:28,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:33:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350174445] [2025-03-04 00:33:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:28,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:33:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:28,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:33:28,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:28,113 INFO L87 Difference]: Start difference. First operand 9711 states and 15524 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:28,979 INFO L93 Difference]: Finished difference Result 23825 states and 38212 transitions. [2025-03-04 00:33:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:29,022 INFO L225 Difference]: With dead ends: 23825 [2025-03-04 00:33:29,023 INFO L226 Difference]: Without dead ends: 14229 [2025-03-04 00:33:29,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:33:29,041 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 877 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:29,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1427 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:33:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14229 states. [2025-03-04 00:33:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14229 to 10563. [2025-03-04 00:33:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 9939 states have (on average 1.5629338967702988) internal successors, (15534), 9957 states have internal predecessors, (15534), 593 states have call successors, (593), 30 states have call predecessors, (593), 30 states have return successors, (593), 575 states have call predecessors, (593), 593 states have call successors, (593) [2025-03-04 00:33:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 16720 transitions. [2025-03-04 00:33:29,356 INFO L78 Accepts]: Start accepts. Automaton has 10563 states and 16720 transitions. Word has length 455 [2025-03-04 00:33:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:29,356 INFO L471 AbstractCegarLoop]: Abstraction has 10563 states and 16720 transitions. [2025-03-04 00:33:29,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10563 states and 16720 transitions. [2025-03-04 00:33:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:29,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:29,369 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:29,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:33:29,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:29,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1795820446, now seen corresponding path program 1 times [2025-03-04 00:33:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:29,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954031349] [2025-03-04 00:33:29,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:29,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:29,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:29,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:29,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954031349] [2025-03-04 00:33:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954031349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:30,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:30,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765722539] [2025-03-04 00:33:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:30,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:30,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:30,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:30,274 INFO L87 Difference]: Start difference. First operand 10563 states and 16720 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:30,804 INFO L93 Difference]: Finished difference Result 31403 states and 49675 transitions. [2025-03-04 00:33:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:30,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:30,849 INFO L225 Difference]: With dead ends: 31403 [2025-03-04 00:33:30,849 INFO L226 Difference]: Without dead ends: 20715 [2025-03-04 00:33:30,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:30,873 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 535 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:30,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1384 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:33:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20715 states. [2025-03-04 00:33:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20715 to 13203. [2025-03-04 00:33:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13203 states, 12579 states have (on average 1.5683281659909374) internal successors, (19728), 12597 states have internal predecessors, (19728), 593 states have call successors, (593), 30 states have call predecessors, (593), 30 states have return successors, (593), 575 states have call predecessors, (593), 593 states have call successors, (593) [2025-03-04 00:33:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13203 states to 13203 states and 20914 transitions. [2025-03-04 00:33:31,301 INFO L78 Accepts]: Start accepts. Automaton has 13203 states and 20914 transitions. Word has length 455 [2025-03-04 00:33:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:31,302 INFO L471 AbstractCegarLoop]: Abstraction has 13203 states and 20914 transitions. [2025-03-04 00:33:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13203 states and 20914 transitions. [2025-03-04 00:33:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:31,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:31,315 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:33:31,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:31,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:31,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1549507359, now seen corresponding path program 1 times [2025-03-04 00:33:31,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:31,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947458826] [2025-03-04 00:33:31,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:31,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:31,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:31,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947458826] [2025-03-04 00:33:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947458826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:33:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005050006] [2025-03-04 00:33:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:31,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:33:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:31,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:33:31,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:31,487 INFO L87 Difference]: Start difference. First operand 13203 states and 20914 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:31,922 INFO L93 Difference]: Finished difference Result 33495 states and 53038 transitions. [2025-03-04 00:33:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:33:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:31,968 INFO L225 Difference]: With dead ends: 33495 [2025-03-04 00:33:31,968 INFO L226 Difference]: Without dead ends: 20407 [2025-03-04 00:33:31,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:33:31,980 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 325 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:31,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1084 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:33:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20407 states. [2025-03-04 00:33:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20407 to 15395. [2025-03-04 00:33:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15395 states, 14771 states have (on average 1.5738947938528196) internal successors, (23248), 14789 states have internal predecessors, (23248), 593 states have call successors, (593), 30 states have call predecessors, (593), 30 states have return successors, (593), 575 states have call predecessors, (593), 593 states have call successors, (593) [2025-03-04 00:33:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15395 states to 15395 states and 24434 transitions. [2025-03-04 00:33:32,500 INFO L78 Accepts]: Start accepts. Automaton has 15395 states and 24434 transitions. Word has length 455 [2025-03-04 00:33:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:32,501 INFO L471 AbstractCegarLoop]: Abstraction has 15395 states and 24434 transitions. [2025-03-04 00:33:32,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 15395 states and 24434 transitions. [2025-03-04 00:33:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:32,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:32,524 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:32,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:33:32,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:32,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1326291912, now seen corresponding path program 1 times [2025-03-04 00:33:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411952930] [2025-03-04 00:33:32,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:32,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:32,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:32,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:32,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:36,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411952930] [2025-03-04 00:33:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411952930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 00:33:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855579455] [2025-03-04 00:33:36,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:36,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:33:36,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:36,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:33:36,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:33:36,845 INFO L87 Difference]: Start difference. First operand 15395 states and 24434 transitions. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 3 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-03-04 00:33:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:40,744 INFO L93 Difference]: Finished difference Result 61252 states and 97357 transitions. [2025-03-04 00:33:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:33:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 3 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 455 [2025-03-04 00:33:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:40,823 INFO L225 Difference]: With dead ends: 61252 [2025-03-04 00:33:40,823 INFO L226 Difference]: Without dead ends: 45972 [2025-03-04 00:33:40,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:33:40,847 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 5290 mSDsluCounter, 3737 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5290 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:40,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5290 Valid, 4188 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 00:33:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45972 states. [2025-03-04 00:33:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45972 to 22000. [2025-03-04 00:33:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22000 states, 21376 states have (on average 1.5849550898203593) internal successors, (33880), 21394 states have internal predecessors, (33880), 593 states have call successors, (593), 30 states have call predecessors, (593), 30 states have return successors, (593), 575 states have call predecessors, (593), 593 states have call successors, (593) [2025-03-04 00:33:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 35066 transitions. [2025-03-04 00:33:41,422 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 35066 transitions. Word has length 455 [2025-03-04 00:33:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:41,423 INFO L471 AbstractCegarLoop]: Abstraction has 22000 states and 35066 transitions. [2025-03-04 00:33:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 3 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-03-04 00:33:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 35066 transitions. [2025-03-04 00:33:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:41,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:41,456 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:41,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:33:41,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:41,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1677091849, now seen corresponding path program 1 times [2025-03-04 00:33:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351944612] [2025-03-04 00:33:41,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:41,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:41,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:42,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:42,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351944612] [2025-03-04 00:33:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351944612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:42,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:42,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:42,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664039781] [2025-03-04 00:33:42,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:42,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:42,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:42,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:42,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:42,378 INFO L87 Difference]: Start difference. First operand 22000 states and 35066 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:42,961 INFO L93 Difference]: Finished difference Result 45120 states and 71788 transitions. [2025-03-04 00:33:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:43,016 INFO L225 Difference]: With dead ends: 45120 [2025-03-04 00:33:43,017 INFO L226 Difference]: Without dead ends: 26324 [2025-03-04 00:33:43,027 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-04 00:33:43,028 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 460 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:43,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1061 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:33:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26324 states. [2025-03-04 00:33:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26324 to 19664. [2025-03-04 00:33:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19664 states, 19183 states have (on average 1.5830162122712819) internal successors, (30367), 19193 states have internal predecessors, (30367), 449 states have call successors, (449), 31 states have call predecessors, (449), 31 states have return successors, (449), 439 states have call predecessors, (449), 449 states have call successors, (449) [2025-03-04 00:33:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19664 states to 19664 states and 31265 transitions. [2025-03-04 00:33:43,601 INFO L78 Accepts]: Start accepts. Automaton has 19664 states and 31265 transitions. Word has length 455 [2025-03-04 00:33:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 19664 states and 31265 transitions. [2025-03-04 00:33:43,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19664 states and 31265 transitions. [2025-03-04 00:33:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:43,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:43,626 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:43,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:33:43,626 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:43,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1610085096, now seen corresponding path program 1 times [2025-03-04 00:33:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:43,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5964842] [2025-03-04 00:33:43,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:43,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:43,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:44,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:44,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:44,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5964842] [2025-03-04 00:33:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5964842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:33:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266193599] [2025-03-04 00:33:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:33:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:44,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:33:44,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:44,936 INFO L87 Difference]: Start difference. First operand 19664 states and 31265 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:45,739 INFO L93 Difference]: Finished difference Result 50542 states and 80359 transitions. [2025-03-04 00:33:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:33:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 455 [2025-03-04 00:33:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:45,779 INFO L225 Difference]: With dead ends: 50542 [2025-03-04 00:33:45,779 INFO L226 Difference]: Without dead ends: 31010 [2025-03-04 00:33:45,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:33:45,794 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 318 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:45,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1511 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31010 states. [2025-03-04 00:33:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31010 to 19664. [2025-03-04 00:33:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19664 states, 19183 states have (on average 1.5828076943126728) internal successors, (30363), 19193 states have internal predecessors, (30363), 449 states have call successors, (449), 31 states have call predecessors, (449), 31 states have return successors, (449), 439 states have call predecessors, (449), 449 states have call successors, (449) [2025-03-04 00:33:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19664 states to 19664 states and 31261 transitions. [2025-03-04 00:33:46,146 INFO L78 Accepts]: Start accepts. Automaton has 19664 states and 31261 transitions. Word has length 455 [2025-03-04 00:33:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:46,147 INFO L471 AbstractCegarLoop]: Abstraction has 19664 states and 31261 transitions. [2025-03-04 00:33:46,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 19664 states and 31261 transitions. [2025-03-04 00:33:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:33:46,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:46,168 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:46,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:33:46,168 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1168330601, now seen corresponding path program 1 times [2025-03-04 00:33:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476269228] [2025-03-04 00:33:46,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:46,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:47,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:47,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:47,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 00:33:48,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476269228] [2025-03-04 00:33:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476269228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986668921] [2025-03-04 00:33:48,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:48,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:48,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:33:48,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:33:48,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:33:48,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:48,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:48,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:33:48,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3462 proven. 126 refuted. 0 times theorem prover too weak. 4224 trivial. 0 not checked. [2025-03-04 00:33:48,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 60 proven. 126 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 00:33:49,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986668921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:49,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:49,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:33:49,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818379173] [2025-03-04 00:33:49,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:49,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:33:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:49,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:33:49,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:33:49,041 INFO L87 Difference]: Start difference. First operand 19664 states and 31261 transitions. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) [2025-03-04 00:33:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:49,849 INFO L93 Difference]: Finished difference Result 38032 states and 60366 transitions. [2025-03-04 00:33:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:33:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) Word has length 455 [2025-03-04 00:33:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:49,876 INFO L225 Difference]: With dead ends: 38032 [2025-03-04 00:33:49,876 INFO L226 Difference]: Without dead ends: 15812 [2025-03-04 00:33:49,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 907 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:33:49,899 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 485 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:49,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1005 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:33:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15812 states. [2025-03-04 00:33:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15812 to 14716. [2025-03-04 00:33:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14716 states, 14215 states have (on average 1.5487161449173408) internal successors, (22015), 14225 states have internal predecessors, (22015), 449 states have call successors, (449), 51 states have call predecessors, (449), 51 states have return successors, (449), 439 states have call predecessors, (449), 449 states have call successors, (449) [2025-03-04 00:33:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14716 states to 14716 states and 22913 transitions. [2025-03-04 00:33:50,393 INFO L78 Accepts]: Start accepts. Automaton has 14716 states and 22913 transitions. Word has length 455 [2025-03-04 00:33:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:50,394 INFO L471 AbstractCegarLoop]: Abstraction has 14716 states and 22913 transitions. [2025-03-04 00:33:50,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) [2025-03-04 00:33:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14716 states and 22913 transitions. [2025-03-04 00:33:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-04 00:33:50,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:50,415 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:50,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:33:50,619 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,SelfDestructingSolverStorable15 [2025-03-04 00:33:50,619 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:50,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash -460304951, now seen corresponding path program 1 times [2025-03-04 00:33:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541420571] [2025-03-04 00:33:50,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:50,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:50,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-04 00:33:51,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 00:33:51,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:51,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541420571] [2025-03-04 00:33:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541420571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:51,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:51,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:33:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845931227] [2025-03-04 00:33:51,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:51,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:33:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:51,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:33:51,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:33:51,433 INFO L87 Difference]: Start difference. First operand 14716 states and 22913 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:51,916 INFO L93 Difference]: Finished difference Result 28200 states and 43747 transitions. [2025-03-04 00:33:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:33:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 456 [2025-03-04 00:33:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:51,938 INFO L225 Difference]: With dead ends: 28200 [2025-03-04 00:33:51,938 INFO L226 Difference]: Without dead ends: 14390 [2025-03-04 00:33:51,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:33:51,954 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 358 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:51,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1259 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:33:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14390 states. [2025-03-04 00:33:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14390 to 11360. [2025-03-04 00:33:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11360 states, 10859 states have (on average 1.5394603554655124) internal successors, (16717), 10869 states have internal predecessors, (16717), 449 states have call successors, (449), 51 states have call predecessors, (449), 51 states have return successors, (449), 439 states have call predecessors, (449), 449 states have call successors, (449) [2025-03-04 00:33:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 17615 transitions. [2025-03-04 00:33:52,220 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 17615 transitions. Word has length 456 [2025-03-04 00:33:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:52,221 INFO L471 AbstractCegarLoop]: Abstraction has 11360 states and 17615 transitions. [2025-03-04 00:33:52,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 17615 transitions. [2025-03-04 00:33:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-04 00:33:52,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:52,227 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:52,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:33:52,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:52,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1136844587, now seen corresponding path program 1 times [2025-03-04 00:33:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755533528] [2025-03-04 00:33:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:52,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-04 00:33:52,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-04 00:33:52,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:52,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:33:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755533528] [2025-03-04 00:33:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755533528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:33:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919628875] [2025-03-04 00:33:54,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:33:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:54,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:33:54,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:33:54,038 INFO L87 Difference]: Start difference. First operand 11360 states and 17615 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:55,819 INFO L93 Difference]: Finished difference Result 45054 states and 69686 transitions. [2025-03-04 00:33:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:33:55,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 457 [2025-03-04 00:33:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:55,874 INFO L225 Difference]: With dead ends: 45054 [2025-03-04 00:33:55,874 INFO L226 Difference]: Without dead ends: 35258 [2025-03-04 00:33:55,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:33:55,896 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 1966 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:55,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 2432 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:33:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35258 states. [2025-03-04 00:33:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35258 to 31758. [2025-03-04 00:33:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31758 states, 30485 states have (on average 1.5439396424471052) internal successors, (47067), 30517 states have internal predecessors, (47067), 1131 states have call successors, (1131), 141 states have call predecessors, (1131), 141 states have return successors, (1131), 1099 states have call predecessors, (1131), 1131 states have call successors, (1131) [2025-03-04 00:33:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31758 states to 31758 states and 49329 transitions. [2025-03-04 00:33:56,843 INFO L78 Accepts]: Start accepts. Automaton has 31758 states and 49329 transitions. Word has length 457 [2025-03-04 00:33:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:56,844 INFO L471 AbstractCegarLoop]: Abstraction has 31758 states and 49329 transitions. [2025-03-04 00:33:56,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:33:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31758 states and 49329 transitions. [2025-03-04 00:33:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-04 00:33:56,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:56,854 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:33:56,854 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1487644524, now seen corresponding path program 1 times [2025-03-04 00:33:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:56,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185027838] [2025-03-04 00:33:56,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:56,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:56,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-04 00:33:59,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-04 00:33:59,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:59,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 00:34:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185027838] [2025-03-04 00:34:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185027838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:01,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979330546] [2025-03-04 00:34:01,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:01,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:01,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:34:01,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:34:01,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-04 00:34:01,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-04 00:34:01,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:01,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:01,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:34:01,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 62 proven. 186 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-04 00:34:01,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:34:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979330546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:03,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:34:03,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 13 [2025-03-04 00:34:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600217576] [2025-03-04 00:34:03,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:34:03,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:34:03,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:03,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:34:03,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:34:03,069 INFO L87 Difference]: Start difference. First operand 31758 states and 49329 transitions. Second operand has 13 states, 13 states have (on average 16.53846153846154) internal successors, (215), 13 states have internal predecessors, (215), 2 states have call successors, (125), 2 states have call predecessors, (125), 3 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-04 00:34:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:06,096 INFO L93 Difference]: Finished difference Result 78798 states and 122003 transitions. [2025-03-04 00:34:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:34:06,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.53846153846154) internal successors, (215), 13 states have internal predecessors, (215), 2 states have call successors, (125), 2 states have call predecessors, (125), 3 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) Word has length 457 [2025-03-04 00:34:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:06,168 INFO L225 Difference]: With dead ends: 78798 [2025-03-04 00:34:06,168 INFO L226 Difference]: Without dead ends: 48542 [2025-03-04 00:34:06,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:34:06,208 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 2083 mSDsluCounter, 2915 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:06,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 3237 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:34:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48542 states. [2025-03-04 00:34:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48542 to 40450. [2025-03-04 00:34:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40450 states, 38758 states have (on average 1.531864389287373) internal successors, (59372), 38802 states have internal predecessors, (59372), 1455 states have call successors, (1455), 236 states have call predecessors, (1455), 236 states have return successors, (1455), 1411 states have call predecessors, (1455), 1455 states have call successors, (1455) [2025-03-04 00:34:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40450 states to 40450 states and 62282 transitions. [2025-03-04 00:34:07,310 INFO L78 Accepts]: Start accepts. Automaton has 40450 states and 62282 transitions. Word has length 457 [2025-03-04 00:34:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:07,310 INFO L471 AbstractCegarLoop]: Abstraction has 40450 states and 62282 transitions. [2025-03-04 00:34:07,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.53846153846154) internal successors, (215), 13 states have internal predecessors, (215), 2 states have call successors, (125), 2 states have call predecessors, (125), 3 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-04 00:34:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 40450 states and 62282 transitions. [2025-03-04 00:34:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-04 00:34:07,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:07,320 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:34:07,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:34:07,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:07,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 488508319, now seen corresponding path program 1 times [2025-03-04 00:34:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:07,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774806309] [2025-03-04 00:34:07,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:07,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-04 00:34:08,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-04 00:34:08,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:08,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 00:34:09,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774806309] [2025-03-04 00:34:09,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774806309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:34:09,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271324400] [2025-03-04 00:34:09,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:09,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:09,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:34:09,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:34:09,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:34:09,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-04 00:34:09,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-04 00:34:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:09,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:34:09,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:34:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3626 proven. 120 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2025-03-04 00:34:10,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:34:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 66 proven. 120 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-04 00:34:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271324400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:34:12,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:34:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 27 [2025-03-04 00:34:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436188204] [2025-03-04 00:34:12,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:34:12,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 00:34:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:12,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 00:34:12,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:34:12,839 INFO L87 Difference]: Start difference. First operand 40450 states and 62282 transitions. Second operand has 27 states, 27 states have (on average 13.296296296296296) internal successors, (359), 27 states have internal predecessors, (359), 6 states have call successors, (189), 3 states have call predecessors, (189), 6 states have return successors, (189), 6 states have call predecessors, (189), 6 states have call successors, (189) [2025-03-04 00:34:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:16,741 INFO L93 Difference]: Finished difference Result 96034 states and 148010 transitions. [2025-03-04 00:34:16,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 00:34:16,742 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.296296296296296) internal successors, (359), 27 states have internal predecessors, (359), 6 states have call successors, (189), 3 states have call predecessors, (189), 6 states have return successors, (189), 6 states have call predecessors, (189), 6 states have call successors, (189) Word has length 458 [2025-03-04 00:34:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:16,811 INFO L225 Difference]: With dead ends: 96034 [2025-03-04 00:34:16,811 INFO L226 Difference]: Without dead ends: 55738 [2025-03-04 00:34:16,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 902 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=753, Invalid=2439, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 00:34:16,832 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 3294 mSDsluCounter, 5162 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3356 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 4907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:16,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3356 Valid, 5559 Invalid, 4907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 00:34:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55738 states. [2025-03-04 00:34:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55738 to 46808. [2025-03-04 00:34:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46808 states, 45113 states have (on average 1.5319974286790947) internal successors, (69113), 45157 states have internal predecessors, (69113), 1455 states have call successors, (1455), 239 states have call predecessors, (1455), 239 states have return successors, (1455), 1411 states have call predecessors, (1455), 1455 states have call successors, (1455) [2025-03-04 00:34:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46808 states to 46808 states and 72023 transitions. [2025-03-04 00:34:17,935 INFO L78 Accepts]: Start accepts. Automaton has 46808 states and 72023 transitions. Word has length 458 [2025-03-04 00:34:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:34:17,935 INFO L471 AbstractCegarLoop]: Abstraction has 46808 states and 72023 transitions. [2025-03-04 00:34:17,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.296296296296296) internal successors, (359), 27 states have internal predecessors, (359), 6 states have call successors, (189), 3 states have call predecessors, (189), 6 states have return successors, (189), 6 states have call predecessors, (189), 6 states have call successors, (189) [2025-03-04 00:34:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 46808 states and 72023 transitions. [2025-03-04 00:34:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-04 00:34:17,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:34:17,947 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:34:17,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:34:18,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:34:18,147 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:34:18,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:34:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash -479248216, now seen corresponding path program 1 times [2025-03-04 00:34:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:34:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472752170] [2025-03-04 00:34:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:34:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:34:18,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 00:34:18,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 00:34:18,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:34:18,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:34:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:34:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:34:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472752170] [2025-03-04 00:34:18,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472752170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:34:18,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:34:18,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:34:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708008967] [2025-03-04 00:34:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:34:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:34:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:34:18,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:34:18,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:34:18,673 INFO L87 Difference]: Start difference. First operand 46808 states and 72023 transitions. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-03-04 00:34:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:34:22,108 INFO L93 Difference]: Finished difference Result 133698 states and 205442 transitions. [2025-03-04 00:34:22,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:34:22,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 3 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 459 [2025-03-04 00:34:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:34:22,237 INFO L225 Difference]: With dead ends: 133698 [2025-03-04 00:34:22,237 INFO L226 Difference]: Without dead ends: 92750 [2025-03-04 00:34:22,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:34:22,283 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 1224 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:34:22,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2764 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:34:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92750 states.