./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12c4232328ebed2959d46283ec7c985dd6c5525d615e314238386424a59fd52d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:47:19,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:47:20,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:47:20,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:47:20,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:47:20,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:47:20,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:47:20,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:47:20,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:47:20,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:47:20,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:47:20,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:47:20,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:47:20,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:47:20,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:47:20,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:47:20,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:47:20,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:47:20,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:47:20,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:47:20,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:47:20,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:20,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:47:20,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:47:20,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:47:20,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:47:20,052 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12c4232328ebed2959d46283ec7c985dd6c5525d615e314238386424a59fd52d [2025-03-08 15:47:20,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:47:20,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:47:20,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:47:20,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:47:20,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:47:20,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i [2025-03-08 15:47:21,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760aa924f/1a9da0bb0ec34aafbb6b48f126a9efa4/FLAG8f489e248 [2025-03-08 15:47:21,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:47:21,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i [2025-03-08 15:47:21,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760aa924f/1a9da0bb0ec34aafbb6b48f126a9efa4/FLAG8f489e248 [2025-03-08 15:47:21,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760aa924f/1a9da0bb0ec34aafbb6b48f126a9efa4 [2025-03-08 15:47:21,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:47:21,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:47:21,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:21,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:47:21,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:47:21,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:21" (1/1) ... [2025-03-08 15:47:21,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642e99a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:21, skipping insertion in model container [2025-03-08 15:47:21,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:21" (1/1) ... [2025-03-08 15:47:22,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:47:22,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i[916,929] [2025-03-08 15:47:22,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:22,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:47:22,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-74.i[916,929] [2025-03-08 15:47:22,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:22,407 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:47:22,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22 WrapperNode [2025-03-08 15:47:22,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:22,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:22,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:47:22,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:47:22,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,538 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 718 [2025-03-08 15:47:22,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:22,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:47:22,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:47:22,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:47:22,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,669 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:47:22,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:47:22,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:47:22,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:47:22,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:47:22,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (1/1) ... [2025-03-08 15:47:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:22,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:47:22,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:47:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:47:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:47:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:47:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:47:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:47:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:47:22,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:47:22,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:47:23,871 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short57#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~bitwise61#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~ite66#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short67#1; [2025-03-08 15:47:24,030 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 15:47:24,030 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:47:24,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:47:24,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:47:24,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:24 BoogieIcfgContainer [2025-03-08 15:47:24,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:47:24,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:47:24,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:47:24,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:47:24,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:47:21" (1/3) ... [2025-03-08 15:47:24,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4ad76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:24, skipping insertion in model container [2025-03-08 15:47:24,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:22" (2/3) ... [2025-03-08 15:47:24,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4ad76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:24, skipping insertion in model container [2025-03-08 15:47:24,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:24" (3/3) ... [2025-03-08 15:47:24,063 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-74.i [2025-03-08 15:47:24,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:47:24,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-74.i that has 2 procedures, 292 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:47:24,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:47:24,153 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;@6fdef841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:47:24,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:47:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 216 states have (on average 1.537037037037037) internal successors, (332), 217 states have internal predecessors, (332), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 15:47:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:24,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:24,191 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:24,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash 155238656, now seen corresponding path program 1 times [2025-03-08 15:47:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454017769] [2025-03-08 15:47:24,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:24,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:24,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:24,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:24,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454017769] [2025-03-08 15:47:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454017769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:25,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717507941] [2025-03-08 15:47:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:25,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:25,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:25,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:25,143 INFO L87 Difference]: Start difference. First operand has 292 states, 216 states have (on average 1.537037037037037) internal successors, (332), 217 states have internal predecessors, (332), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:25,431 INFO L93 Difference]: Finished difference Result 777 states and 1387 transitions. [2025-03-08 15:47:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:25,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:25,448 INFO L225 Difference]: With dead ends: 777 [2025-03-08 15:47:25,448 INFO L226 Difference]: Without dead ends: 488 [2025-03-08 15:47:25,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:25,458 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 314 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:25,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:25,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-08 15:47:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 485. [2025-03-08 15:47:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 373 states have (on average 1.5281501340482573) internal successors, (570), 374 states have internal predecessors, (570), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 15:47:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 788 transitions. [2025-03-08 15:47:25,574 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 788 transitions. Word has length 496 [2025-03-08 15:47:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:25,578 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 788 transitions. [2025-03-08 15:47:25,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 788 transitions. [2025-03-08 15:47:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:25,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:25,590 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:25,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 15:47:25,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:25,593 INFO L85 PathProgramCache]: Analyzing trace with hash -328436671, now seen corresponding path program 1 times [2025-03-08 15:47:25,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:25,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664274630] [2025-03-08 15:47:25,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:25,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:25,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:25,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:26,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664274630] [2025-03-08 15:47:26,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664274630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:26,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:26,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617395773] [2025-03-08 15:47:26,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:26,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:26,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:26,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:26,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:26,046 INFO L87 Difference]: Start difference. First operand 485 states and 788 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:26,196 INFO L93 Difference]: Finished difference Result 1335 states and 2173 transitions. [2025-03-08 15:47:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:26,206 INFO L225 Difference]: With dead ends: 1335 [2025-03-08 15:47:26,206 INFO L226 Difference]: Without dead ends: 853 [2025-03-08 15:47:26,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:26,209 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 306 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:26,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-08 15:47:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 849. [2025-03-08 15:47:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 685 states have (on average 1.5489051094890511) internal successors, (1061), 688 states have internal predecessors, (1061), 159 states have call successors, (159), 4 states have call predecessors, (159), 4 states have return successors, (159), 156 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-08 15:47:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1379 transitions. [2025-03-08 15:47:26,283 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1379 transitions. Word has length 496 [2025-03-08 15:47:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:26,284 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1379 transitions. [2025-03-08 15:47:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1379 transitions. [2025-03-08 15:47:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:26,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:26,290 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:26,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:47:26,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:26,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -936513534, now seen corresponding path program 1 times [2025-03-08 15:47:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134558068] [2025-03-08 15:47:26,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:26,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:26,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:26,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:26,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:27,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134558068] [2025-03-08 15:47:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134558068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:27,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361740396] [2025-03-08 15:47:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:27,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:27,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:27,184 INFO L87 Difference]: Start difference. First operand 849 states and 1379 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:27,523 INFO L93 Difference]: Finished difference Result 2392 states and 3899 transitions. [2025-03-08 15:47:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:27,534 INFO L225 Difference]: With dead ends: 2392 [2025-03-08 15:47:27,535 INFO L226 Difference]: Without dead ends: 1546 [2025-03-08 15:47:27,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:27,538 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 512 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:27,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1358 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-08 15:47:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 982. [2025-03-08 15:47:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 744 states have (on average 1.5134408602150538) internal successors, (1126), 747 states have internal predecessors, (1126), 232 states have call successors, (232), 5 states have call predecessors, (232), 5 states have return successors, (232), 229 states have call predecessors, (232), 232 states have call successors, (232) [2025-03-08 15:47:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1590 transitions. [2025-03-08 15:47:27,655 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1590 transitions. Word has length 496 [2025-03-08 15:47:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:27,656 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1590 transitions. [2025-03-08 15:47:27,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1590 transitions. [2025-03-08 15:47:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:27,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:27,665 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:47:27,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:27,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 172301665, now seen corresponding path program 1 times [2025-03-08 15:47:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:27,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363255588] [2025-03-08 15:47:27,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:27,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:27,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:27,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363255588] [2025-03-08 15:47:29,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363255588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:29,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:29,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:29,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828612408] [2025-03-08 15:47:29,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:29,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:29,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:29,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:29,169 INFO L87 Difference]: Start difference. First operand 982 states and 1590 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:29,651 INFO L93 Difference]: Finished difference Result 2026 states and 3248 transitions. [2025-03-08 15:47:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:29,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:29,661 INFO L225 Difference]: With dead ends: 2026 [2025-03-08 15:47:29,661 INFO L226 Difference]: Without dead ends: 1180 [2025-03-08 15:47:29,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:29,665 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 379 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:29,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1445 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-08 15:47:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1016. [2025-03-08 15:47:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 782 states have (on average 1.5038363171355498) internal successors, (1176), 785 states have internal predecessors, (1176), 224 states have call successors, (224), 9 states have call predecessors, (224), 9 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 15:47:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1624 transitions. [2025-03-08 15:47:29,749 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1624 transitions. Word has length 496 [2025-03-08 15:47:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:29,750 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1624 transitions. [2025-03-08 15:47:29,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1624 transitions. [2025-03-08 15:47:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:29,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:29,757 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:29,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:47:29,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:29,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1865754624, now seen corresponding path program 1 times [2025-03-08 15:47:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:29,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915353999] [2025-03-08 15:47:29,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:29,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:30,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:30,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915353999] [2025-03-08 15:47:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915353999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:30,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:30,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:30,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114084391] [2025-03-08 15:47:30,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:30,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:30,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:30,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:30,687 INFO L87 Difference]: Start difference. First operand 1016 states and 1624 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:31,318 INFO L93 Difference]: Finished difference Result 3094 states and 4954 transitions. [2025-03-08 15:47:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:31,331 INFO L225 Difference]: With dead ends: 3094 [2025-03-08 15:47:31,331 INFO L226 Difference]: Without dead ends: 2222 [2025-03-08 15:47:31,333 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-08 15:47:31,334 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1064 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:31,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 1355 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:47:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-08 15:47:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2191. [2025-03-08 15:47:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 1748 states have (on average 1.509725400457666) internal successors, (2639), 1757 states have internal predecessors, (2639), 423 states have call successors, (423), 19 states have call predecessors, (423), 19 states have return successors, (423), 414 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-08 15:47:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 3485 transitions. [2025-03-08 15:47:31,465 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 3485 transitions. Word has length 496 [2025-03-08 15:47:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:31,466 INFO L471 AbstractCegarLoop]: Abstraction has 2191 states and 3485 transitions. [2025-03-08 15:47:31,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 3485 transitions. [2025-03-08 15:47:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:31,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:31,473 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:31,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:47:31,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash -50217887, now seen corresponding path program 1 times [2025-03-08 15:47:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:31,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350411553] [2025-03-08 15:47:31,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:31,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:31,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:31,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:32,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350411553] [2025-03-08 15:47:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350411553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011728031] [2025-03-08 15:47:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:32,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:32,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:32,607 INFO L87 Difference]: Start difference. First operand 2191 states and 3485 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:33,286 INFO L93 Difference]: Finished difference Result 6490 states and 10314 transitions. [2025-03-08 15:47:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:47:33,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:33,311 INFO L225 Difference]: With dead ends: 6490 [2025-03-08 15:47:33,311 INFO L226 Difference]: Without dead ends: 4034 [2025-03-08 15:47:33,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:33,321 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1078 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:33,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1401 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2025-03-08 15:47:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 2242. [2025-03-08 15:47:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1799 states have (on average 1.5063924402445803) internal successors, (2710), 1808 states have internal predecessors, (2710), 423 states have call successors, (423), 19 states have call predecessors, (423), 19 states have return successors, (423), 414 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-08 15:47:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3556 transitions. [2025-03-08 15:47:33,492 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3556 transitions. Word has length 496 [2025-03-08 15:47:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:33,493 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3556 transitions. [2025-03-08 15:47:33,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3556 transitions. [2025-03-08 15:47:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:33,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:33,503 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:47:33,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:33,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1861371009, now seen corresponding path program 1 times [2025-03-08 15:47:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100040264] [2025-03-08 15:47:33,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:33,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:33,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:33,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:33,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100040264] [2025-03-08 15:47:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100040264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669659054] [2025-03-08 15:47:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:34,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:34,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:34,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:34,393 INFO L87 Difference]: Start difference. First operand 2242 states and 3556 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:35,035 INFO L93 Difference]: Finished difference Result 5654 states and 8844 transitions. [2025-03-08 15:47:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:35,055 INFO L225 Difference]: With dead ends: 5654 [2025-03-08 15:47:35,055 INFO L226 Difference]: Without dead ends: 3556 [2025-03-08 15:47:35,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:35,062 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 441 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:35,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1444 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2025-03-08 15:47:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 2262. [2025-03-08 15:47:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2262 states, 1819 states have (on average 1.5035733919736118) internal successors, (2735), 1828 states have internal predecessors, (2735), 423 states have call successors, (423), 19 states have call predecessors, (423), 19 states have return successors, (423), 414 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-08 15:47:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 3581 transitions. [2025-03-08 15:47:35,206 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 3581 transitions. Word has length 496 [2025-03-08 15:47:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 2262 states and 3581 transitions. [2025-03-08 15:47:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 3581 transitions. [2025-03-08 15:47:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:35,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:35,214 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:35,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:47:35,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:35,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:35,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2072721922, now seen corresponding path program 1 times [2025-03-08 15:47:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754924592] [2025-03-08 15:47:35,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:35,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:35,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:35,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:35,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:36,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754924592] [2025-03-08 15:47:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754924592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:36,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:36,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:47:36,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877499451] [2025-03-08 15:47:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:36,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:47:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:36,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:47:36,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:36,746 INFO L87 Difference]: Start difference. First operand 2262 states and 3581 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:37,375 INFO L93 Difference]: Finished difference Result 7235 states and 11396 transitions. [2025-03-08 15:47:37,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:47:37,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 496 [2025-03-08 15:47:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:37,399 INFO L225 Difference]: With dead ends: 7235 [2025-03-08 15:47:37,400 INFO L226 Difference]: Without dead ends: 5117 [2025-03-08 15:47:37,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:47:37,408 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 496 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:37,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2619 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2025-03-08 15:47:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 5093. [2025-03-08 15:47:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5093 states, 4458 states have (on average 1.5336473755047106) internal successors, (6837), 4487 states have internal predecessors, (6837), 583 states have call successors, (583), 51 states have call predecessors, (583), 51 states have return successors, (583), 554 states have call predecessors, (583), 583 states have call successors, (583) [2025-03-08 15:47:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5093 states to 5093 states and 8003 transitions. [2025-03-08 15:47:37,649 INFO L78 Accepts]: Start accepts. Automaton has 5093 states and 8003 transitions. Word has length 496 [2025-03-08 15:47:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:37,651 INFO L471 AbstractCegarLoop]: Abstraction has 5093 states and 8003 transitions. [2025-03-08 15:47:37,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 15:47:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 5093 states and 8003 transitions. [2025-03-08 15:47:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:37,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:37,662 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:37,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:47:37,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:37,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1453075359, now seen corresponding path program 1 times [2025-03-08 15:47:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044229383] [2025-03-08 15:47:37,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:37,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:37,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:37,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:37,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 15:47:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:38,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044229383] [2025-03-08 15:47:38,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044229383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:38,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:47:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791180139] [2025-03-08 15:47:38,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:38,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:47:38,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:38,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:47:38,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:47:38,443 INFO L87 Difference]: Start difference. First operand 5093 states and 8003 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 15:47:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:39,295 INFO L93 Difference]: Finished difference Result 13597 states and 21426 transitions. [2025-03-08 15:47:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 496 [2025-03-08 15:47:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:39,360 INFO L225 Difference]: With dead ends: 13597 [2025-03-08 15:47:39,360 INFO L226 Difference]: Without dead ends: 8656 [2025-03-08 15:47:39,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:47:39,372 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 682 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:39,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1489 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2025-03-08 15:47:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8654. [2025-03-08 15:47:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8654 states, 7573 states have (on average 1.534662617192658) internal successors, (11622), 7621 states have internal predecessors, (11622), 1003 states have call successors, (1003), 77 states have call predecessors, (1003), 77 states have return successors, (1003), 955 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 15:47:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8654 states to 8654 states and 13628 transitions. [2025-03-08 15:47:39,745 INFO L78 Accepts]: Start accepts. Automaton has 8654 states and 13628 transitions. Word has length 496 [2025-03-08 15:47:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:39,746 INFO L471 AbstractCegarLoop]: Abstraction has 8654 states and 13628 transitions. [2025-03-08 15:47:39,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 15:47:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states and 13628 transitions. [2025-03-08 15:47:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-08 15:47:39,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:39,757 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:39,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:47:39,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:39,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 147188611, now seen corresponding path program 1 times [2025-03-08 15:47:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:39,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176479233] [2025-03-08 15:47:39,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:39,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:39,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:40,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:40,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:40,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:47:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176479233] [2025-03-08 15:47:41,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176479233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658432609] [2025-03-08 15:47:41,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:41,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:41,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:41,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:47:41,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-08 15:47:41,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-08 15:47:41,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:41,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:47:41,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4398 proven. 153 refuted. 0 times theorem prover too weak. 5961 trivial. 0 not checked. [2025-03-08 15:47:43,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:47:44,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658432609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:44,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:44,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-03-08 15:47:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069746691] [2025-03-08 15:47:44,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:44,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:47:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:44,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:47:44,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:47:44,121 INFO L87 Difference]: Start difference. First operand 8654 states and 13628 transitions. Second operand has 18 states, 18 states have (on average 18.72222222222222) internal successors, (337), 18 states have internal predecessors, (337), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-08 15:47:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:46,240 INFO L93 Difference]: Finished difference Result 21486 states and 32945 transitions. [2025-03-08 15:47:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 15:47:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 18.72222222222222) internal successors, (337), 18 states have internal predecessors, (337), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) Word has length 496 [2025-03-08 15:47:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:46,284 INFO L225 Difference]: With dead ends: 21486 [2025-03-08 15:47:46,284 INFO L226 Difference]: Without dead ends: 12981 [2025-03-08 15:47:46,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 979 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2025-03-08 15:47:46,299 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1491 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:46,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 2017 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:47:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2025-03-08 15:47:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 4392. [2025-03-08 15:47:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 3727 states have (on average 1.4998658438422323) internal successors, (5590), 3743 states have internal predecessors, (5590), 601 states have call successors, (601), 63 states have call predecessors, (601), 63 states have return successors, (601), 585 states have call predecessors, (601), 601 states have call successors, (601) [2025-03-08 15:47:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6792 transitions. [2025-03-08 15:47:46,742 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6792 transitions. Word has length 496 [2025-03-08 15:47:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:46,743 INFO L471 AbstractCegarLoop]: Abstraction has 4392 states and 6792 transitions. [2025-03-08 15:47:46,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.72222222222222) internal successors, (337), 18 states have internal predecessors, (337), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-08 15:47:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6792 transitions. [2025-03-08 15:47:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-08 15:47:46,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:46,750 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:46,761 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-08 15:47:46,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 15:47:46,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:46,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -148145168, now seen corresponding path program 1 times [2025-03-08 15:47:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448107541] [2025-03-08 15:47:46,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:46,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-08 15:47:48,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-08 15:47:48,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:48,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 159 proven. 57 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:47:48,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:48,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448107541] [2025-03-08 15:47:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448107541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:48,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726452464] [2025-03-08 15:47:48,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:48,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:48,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:47:48,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-08 15:47:48,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-08 15:47:48,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:48,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:48,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:48,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4206 proven. 57 refuted. 0 times theorem prover too weak. 6249 trivial. 0 not checked. [2025-03-08 15:47:49,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 159 proven. 57 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:47:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726452464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:49,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:49,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:47:49,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862449740] [2025-03-08 15:47:49,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:49,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:47:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:49,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:47:49,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:49,402 INFO L87 Difference]: Start difference. First operand 4392 states and 6792 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-03-08 15:47:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:50,014 INFO L93 Difference]: Finished difference Result 8728 states and 13449 transitions. [2025-03-08 15:47:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:47:50,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) Word has length 497 [2025-03-08 15:47:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:50,030 INFO L225 Difference]: With dead ends: 8728 [2025-03-08 15:47:50,030 INFO L226 Difference]: Without dead ends: 4502 [2025-03-08 15:47:50,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:47:50,039 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 915 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:50,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 961 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2025-03-08 15:47:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 4412. [2025-03-08 15:47:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4412 states, 3742 states have (on average 1.4967931587386425) internal successors, (5601), 3758 states have internal predecessors, (5601), 601 states have call successors, (601), 68 states have call predecessors, (601), 68 states have return successors, (601), 585 states have call predecessors, (601), 601 states have call successors, (601) [2025-03-08 15:47:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 6803 transitions. [2025-03-08 15:47:50,324 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 6803 transitions. Word has length 497 [2025-03-08 15:47:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:50,324 INFO L471 AbstractCegarLoop]: Abstraction has 4412 states and 6803 transitions. [2025-03-08 15:47:50,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 3 states have call successors, (111), 2 states have call predecessors, (111), 4 states have return successors, (112), 3 states have call predecessors, (112), 3 states have call successors, (112) [2025-03-08 15:47:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 6803 transitions. [2025-03-08 15:47:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-08 15:47:50,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:50,331 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:50,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:47:50,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 15:47:50,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:50,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash 585888749, now seen corresponding path program 1 times [2025-03-08 15:47:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065671933] [2025-03-08 15:47:50,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:50,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 15:47:51,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 15:47:51,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:51,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:47:52,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065671933] [2025-03-08 15:47:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065671933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440085444] [2025-03-08 15:47:52,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:52,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:52,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:52,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:52,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:47:53,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 15:47:53,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 15:47:53,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:53,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:53,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 15:47:53,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4398 proven. 153 refuted. 0 times theorem prover too weak. 5961 trivial. 0 not checked. [2025-03-08 15:47:54,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 63 proven. 153 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 15:47:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440085444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:55,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2025-03-08 15:47:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429940948] [2025-03-08 15:47:55,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:55,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 15:47:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:55,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 15:47:55,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:47:55,332 INFO L87 Difference]: Start difference. First operand 4412 states and 6803 transitions. Second operand has 26 states, 26 states have (on average 13.5) internal successors, (351), 26 states have internal predecessors, (351), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-08 15:47:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:59,737 INFO L93 Difference]: Finished difference Result 18740 states and 27983 transitions. [2025-03-08 15:47:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-08 15:47:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.5) internal successors, (351), 26 states have internal predecessors, (351), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) Word has length 498 [2025-03-08 15:47:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:59,774 INFO L225 Difference]: With dead ends: 18740 [2025-03-08 15:47:59,774 INFO L226 Difference]: Without dead ends: 14498 [2025-03-08 15:47:59,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 992 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2835 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1636, Invalid=7106, Unknown=0, NotChecked=0, Total=8742 [2025-03-08 15:47:59,785 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 6643 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 1825 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6817 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 4508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1825 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:59,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6817 Valid, 3884 Invalid, 4508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1825 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 15:47:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2025-03-08 15:48:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 7786. [2025-03-08 15:48:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7786 states, 6767 states have (on average 1.5000738879858135) internal successors, (10151), 6803 states have internal predecessors, (10151), 893 states have call successors, (893), 125 states have call predecessors, (893), 125 states have return successors, (893), 857 states have call predecessors, (893), 893 states have call successors, (893) [2025-03-08 15:48:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7786 states to 7786 states and 11937 transitions. [2025-03-08 15:48:00,332 INFO L78 Accepts]: Start accepts. Automaton has 7786 states and 11937 transitions. Word has length 498 [2025-03-08 15:48:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:00,333 INFO L471 AbstractCegarLoop]: Abstraction has 7786 states and 11937 transitions. [2025-03-08 15:48:00,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.5) internal successors, (351), 26 states have internal predecessors, (351), 5 states have call successors, (197), 3 states have call predecessors, (197), 6 states have return successors, (198), 5 states have call predecessors, (198), 5 states have call successors, (198) [2025-03-08 15:48:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7786 states and 11937 transitions. [2025-03-08 15:48:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-08 15:48:00,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:00,341 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:48:00,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:48:00,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:00,542 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:00,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1939198446, now seen corresponding path program 1 times [2025-03-08 15:48:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:00,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642427126] [2025-03-08 15:48:00,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:00,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 15:48:01,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 15:48:01,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:01,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 312 proven. 318 refuted. 0 times theorem prover too weak. 9882 trivial. 0 not checked. [2025-03-08 15:48:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642427126] [2025-03-08 15:48:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642427126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796915386] [2025-03-08 15:48:03,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:03,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:03,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:03,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:48:03,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 15:48:03,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 15:48:03,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:03,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 15:48:03,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7015 proven. 459 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2025-03-08 15:48:06,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:48:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 561 proven. 489 refuted. 0 times theorem prover too weak. 9462 trivial. 0 not checked. [2025-03-08 15:48:09,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796915386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:48:09,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:48:09,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 20] total 45 [2025-03-08 15:48:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344595375] [2025-03-08 15:48:09,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:48:09,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 15:48:09,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:09,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 15:48:09,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1467, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 15:48:09,348 INFO L87 Difference]: Start difference. First operand 7786 states and 11937 transitions. Second operand has 45 states, 43 states have (on average 8.44186046511628) internal successors, (363), 41 states have internal predecessors, (363), 16 states have call successors, (219), 7 states have call predecessors, (219), 15 states have return successors, (219), 16 states have call predecessors, (219), 16 states have call successors, (219) [2025-03-08 15:48:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:35,469 INFO L93 Difference]: Finished difference Result 43453 states and 66835 transitions. [2025-03-08 15:48:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2025-03-08 15:48:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 8.44186046511628) internal successors, (363), 41 states have internal predecessors, (363), 16 states have call successors, (219), 7 states have call predecessors, (219), 15 states have return successors, (219), 16 states have call predecessors, (219), 16 states have call successors, (219) Word has length 498 [2025-03-08 15:48:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:35,564 INFO L225 Difference]: With dead ends: 43453 [2025-03-08 15:48:35,564 INFO L226 Difference]: Without dead ends: 39075 [2025-03-08 15:48:35,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7180 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3270, Invalid=16752, Unknown=0, NotChecked=0, Total=20022 [2025-03-08 15:48:35,581 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 11443 mSDsluCounter, 9803 mSDsCounter, 0 mSdLazyCounter, 7260 mSolverCounterSat, 2996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11488 SdHoareTripleChecker+Valid, 10483 SdHoareTripleChecker+Invalid, 10256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2996 IncrementalHoareTripleChecker+Valid, 7260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:35,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11488 Valid, 10483 Invalid, 10256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2996 Valid, 7260 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2025-03-08 15:48:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39075 states.