./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.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 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:30:32,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:30:32,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:30:32,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:30:32,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:30:32,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:30:32,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:30:32,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:30:32,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:30:32,247 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:30:32,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:30:32,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:30:32,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:30:32,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:30:32,247 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:30:32,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:30:32,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:30:32,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:32,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:30:32,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:30:32,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:30:32,250 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 -> 0f4d1a0f878f07f9b07af3368e16f27fe17adbf3f533e01dbd51821a170a1e65 [2025-03-04 00:30:32,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:30:32,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:30:32,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:30:32,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:30:32,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:30:32,477 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-2.i [2025-03-04 00:30:33,600 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7581a80/4ed09708aad04adaa93a207ea3c53bb1/FLAGd19e6d0cd [2025-03-04 00:30:33,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:30:33,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-2.i [2025-03-04 00:30:33,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7581a80/4ed09708aad04adaa93a207ea3c53bb1/FLAGd19e6d0cd [2025-03-04 00:30:34,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7581a80/4ed09708aad04adaa93a207ea3c53bb1 [2025-03-04 00:30:34,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:30:34,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:30:34,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:34,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:30:34,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:30:34,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34, skipping insertion in model container [2025-03-04 00:30:34,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:30:34,317 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-2.i[915,928] [2025-03-04 00:30:34,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:34,535 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:30:34,545 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-2.i[915,928] [2025-03-04 00:30:34,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:34,670 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:30:34,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34 WrapperNode [2025-03-04 00:30:34,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:34,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:34,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:30:34,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:30:34,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,759 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 702 [2025-03-04 00:30:34,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:34,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:30:34,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:30:34,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:30:34,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:30:34,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:30:34,888 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:30:34,888 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:30:34,888 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:30:34,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (1/1) ... [2025-03-04 00:30:34,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:34,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:30:34,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:30:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:30:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:30:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:30:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:30:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:30:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:30:35,063 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:30:35,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:30:35,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1; [2025-03-04 00:30:35,976 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-03-04 00:30:35,977 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:30:35,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:30:35,998 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:30:35,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:35 BoogieIcfgContainer [2025-03-04 00:30:35,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:30:36,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:30:36,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:30:36,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:30:36,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:30:34" (1/3) ... [2025-03-04 00:30:36,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7474cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:36, skipping insertion in model container [2025-03-04 00:30:36,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:34" (2/3) ... [2025-03-04 00:30:36,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7474cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:36, skipping insertion in model container [2025-03-04 00:30:36,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:35" (3/3) ... [2025-03-04 00:30:36,006 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-2.i [2025-03-04 00:30:36,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:30:36,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-2.i that has 2 procedures, 279 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:30:36,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:30:36,075 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;@49dd0b5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:30:36,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:30:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 203 states have (on average 1.5369458128078817) internal successors, (312), 204 states have internal predecessors, (312), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 00:30:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:36,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:36,102 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] [2025-03-04 00:30:36,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:36,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash 875070065, now seen corresponding path program 1 times [2025-03-04 00:30:36,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:36,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795025493] [2025-03-04 00:30:36,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:36,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:36,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:36,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-04 00:30:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795025493] [2025-03-04 00:30:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795025493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324658676] [2025-03-04 00:30:36,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:36,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:36,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:30:36,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:30:36,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:36,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:36,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:36,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:30:37,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-04 00:30:37,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:30:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324658676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:37,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:30:37,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:30:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532755781] [2025-03-04 00:30:37,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:37,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:30:37,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:37,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:30:37,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:37,081 INFO L87 Difference]: Start difference. First operand has 279 states, 203 states have (on average 1.5369458128078817) internal successors, (312), 204 states have internal predecessors, (312), 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 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-04 00:30:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:37,142 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2025-03-04 00:30:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:30:37,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 494 [2025-03-04 00:30:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:37,154 INFO L225 Difference]: With dead ends: 552 [2025-03-04 00:30:37,155 INFO L226 Difference]: Without dead ends: 276 [2025-03-04 00:30:37,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:37,160 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:37,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:30:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-04 00:30:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-04 00:30:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 201 states have (on average 1.527363184079602) internal successors, (307), 201 states have internal predecessors, (307), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 00:30:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2025-03-04 00:30:37,225 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 494 [2025-03-04 00:30:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2025-03-04 00:30:37,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-04 00:30:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2025-03-04 00:30:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:37,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:37,240 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] [2025-03-04 00:30:37,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:30:37,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:30:37,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:37,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1756629042, now seen corresponding path program 1 times [2025-03-04 00:30:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:37,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984775287] [2025-03-04 00:30:37,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:38,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:38,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:38,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984775287] [2025-03-04 00:30:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984775287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:39,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929300057] [2025-03-04 00:30:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:39,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:39,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:39,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:39,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:39,294 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:39,484 INFO L93 Difference]: Finished difference Result 717 states and 1172 transitions. [2025-03-04 00:30:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:39,493 INFO L225 Difference]: With dead ends: 717 [2025-03-04 00:30:39,495 INFO L226 Difference]: Without dead ends: 444 [2025-03-04 00:30:39,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:39,496 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 737 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:39,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 865 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-04 00:30:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 334. [2025-03-04 00:30:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 258 states have (on average 1.562015503875969) internal successors, (403), 258 states have internal predecessors, (403), 73 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-04 00:30:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 549 transitions. [2025-03-04 00:30:39,535 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 549 transitions. Word has length 494 [2025-03-04 00:30:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:39,536 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 549 transitions. [2025-03-04 00:30:39,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 549 transitions. [2025-03-04 00:30:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:39,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:39,542 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] [2025-03-04 00:30:39,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:30:39,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1965327345, now seen corresponding path program 1 times [2025-03-04 00:30:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:39,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013029016] [2025-03-04 00:30:39,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:39,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:40,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:40,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:41,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:41,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013029016] [2025-03-04 00:30:41,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013029016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:41,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:41,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:41,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284415570] [2025-03-04 00:30:41,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:41,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:41,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:41,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:41,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:41,019 INFO L87 Difference]: Start difference. First operand 334 states and 549 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:41,352 INFO L93 Difference]: Finished difference Result 898 states and 1449 transitions. [2025-03-04 00:30:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:41,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:41,358 INFO L225 Difference]: With dead ends: 898 [2025-03-04 00:30:41,359 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 00:30:41,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:41,363 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 300 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:41,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1369 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 00:30:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 491. [2025-03-04 00:30:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 393 states have (on average 1.5572519083969465) internal successors, (612), 394 states have internal predecessors, (612), 93 states have call successors, (93), 4 states have call predecessors, (93), 4 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-04 00:30:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 798 transitions. [2025-03-04 00:30:41,412 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 798 transitions. Word has length 494 [2025-03-04 00:30:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:41,415 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 798 transitions. [2025-03-04 00:30:41,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 798 transitions. [2025-03-04 00:30:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:41,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:41,424 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] [2025-03-04 00:30:41,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:30:41,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:41,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1368025934, now seen corresponding path program 1 times [2025-03-04 00:30:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256219831] [2025-03-04 00:30:41,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:41,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:41,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:41,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:41,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256219831] [2025-03-04 00:30:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256219831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:30:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124453267] [2025-03-04 00:30:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:30:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:42,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:30:42,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:42,008 INFO L87 Difference]: Start difference. First operand 491 states and 798 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:42,664 INFO L93 Difference]: Finished difference Result 1851 states and 3003 transitions. [2025-03-04 00:30:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:30:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:42,674 INFO L225 Difference]: With dead ends: 1851 [2025-03-04 00:30:42,674 INFO L226 Difference]: Without dead ends: 1363 [2025-03-04 00:30:42,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:42,677 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 680 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:42,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 2051 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:30:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-04 00:30:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1359. [2025-03-04 00:30:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1067 states have (on average 1.5332708528584817) internal successors, (1636), 1070 states have internal predecessors, (1636), 279 states have call successors, (279), 12 states have call predecessors, (279), 12 states have return successors, (279), 276 states have call predecessors, (279), 279 states have call successors, (279) [2025-03-04 00:30:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2194 transitions. [2025-03-04 00:30:42,805 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2194 transitions. Word has length 494 [2025-03-04 00:30:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2194 transitions. [2025-03-04 00:30:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2194 transitions. [2025-03-04 00:30:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:42,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:42,817 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] [2025-03-04 00:30:42,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:30:42,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873326, now seen corresponding path program 1 times [2025-03-04 00:30:42,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:42,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478197203] [2025-03-04 00:30:42,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:42,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:43,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:43,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:43,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478197203] [2025-03-04 00:30:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478197203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448837034] [2025-03-04 00:30:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:43,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:43,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:43,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:43,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:43,700 INFO L87 Difference]: Start difference. First operand 1359 states and 2194 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:44,038 INFO L93 Difference]: Finished difference Result 4428 states and 7115 transitions. [2025-03-04 00:30:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:44,054 INFO L225 Difference]: With dead ends: 4428 [2025-03-04 00:30:44,054 INFO L226 Difference]: Without dead ends: 3072 [2025-03-04 00:30:44,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:44,059 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 485 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:44,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1512 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2025-03-04 00:30:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2689. [2025-03-04 00:30:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2259 states have (on average 1.5657370517928286) internal successors, (3537), 2268 states have internal predecessors, (3537), 405 states have call successors, (405), 24 states have call predecessors, (405), 24 states have return successors, (405), 396 states have call predecessors, (405), 405 states have call successors, (405) [2025-03-04 00:30:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 4347 transitions. [2025-03-04 00:30:44,218 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 4347 transitions. Word has length 494 [2025-03-04 00:30:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 4347 transitions. [2025-03-04 00:30:44,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 4347 transitions. [2025-03-04 00:30:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:44,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:44,247 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] [2025-03-04 00:30:44,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:30:44,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -50167563, now seen corresponding path program 1 times [2025-03-04 00:30:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441864405] [2025-03-04 00:30:44,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:44,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:44,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:44,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:44,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:46,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:46,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441864405] [2025-03-04 00:30:46,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441864405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:30:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998915382] [2025-03-04 00:30:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:46,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:30:46,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:46,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:30:46,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:30:46,596 INFO L87 Difference]: Start difference. First operand 2689 states and 4347 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-04 00:30:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:51,289 INFO L93 Difference]: Finished difference Result 32588 states and 53088 transitions. [2025-03-04 00:30:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 00:30:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:51,397 INFO L225 Difference]: With dead ends: 32588 [2025-03-04 00:30:51,397 INFO L226 Difference]: Without dead ends: 29902 [2025-03-04 00:30:51,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:30:51,414 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 5120 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5120 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:51,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5120 Valid, 4855 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 00:30:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29902 states. [2025-03-04 00:30:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29902 to 17383. [2025-03-04 00:30:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17383 states, 15792 states have (on average 1.5938449848024316) internal successors, (25170), 15870 states have internal predecessors, (25170), 1446 states have call successors, (1446), 144 states have call predecessors, (1446), 144 states have return successors, (1446), 1368 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-04 00:30:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17383 states to 17383 states and 28062 transitions. [2025-03-04 00:30:52,239 INFO L78 Accepts]: Start accepts. Automaton has 17383 states and 28062 transitions. Word has length 494 [2025-03-04 00:30:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 17383 states and 28062 transitions. [2025-03-04 00:30:52,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-04 00:30:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 17383 states and 28062 transitions. [2025-03-04 00:30:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:52,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:52,264 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] [2025-03-04 00:30:52,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:30:52,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1457384246, now seen corresponding path program 1 times [2025-03-04 00:30:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:52,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734939815] [2025-03-04 00:30:52,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:52,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:52,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:52,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:52,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734939815] [2025-03-04 00:30:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734939815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:52,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:52,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:30:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346623632] [2025-03-04 00:30:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:30:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:52,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:30:52,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:52,837 INFO L87 Difference]: Start difference. First operand 17383 states and 28062 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:54,692 INFO L93 Difference]: Finished difference Result 76525 states and 122697 transitions. [2025-03-04 00:30:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:30:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:54,878 INFO L225 Difference]: With dead ends: 76525 [2025-03-04 00:30:54,878 INFO L226 Difference]: Without dead ends: 59117 [2025-03-04 00:30:54,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:54,922 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 941 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:54,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1627 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:30:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59117 states. [2025-03-04 00:30:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59117 to 25851. [2025-03-04 00:30:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25851 states, 24260 states have (on average 1.6002885408079142) internal successors, (38823), 24338 states have internal predecessors, (38823), 1446 states have call successors, (1446), 144 states have call predecessors, (1446), 144 states have return successors, (1446), 1368 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-04 00:30:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25851 states to 25851 states and 41715 transitions. [2025-03-04 00:30:56,173 INFO L78 Accepts]: Start accepts. Automaton has 25851 states and 41715 transitions. Word has length 494 [2025-03-04 00:30:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:56,174 INFO L471 AbstractCegarLoop]: Abstraction has 25851 states and 41715 transitions. [2025-03-04 00:30:56,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 25851 states and 41715 transitions. [2025-03-04 00:30:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:56,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:56,209 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] [2025-03-04 00:30:56,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:30:56,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1008687607, now seen corresponding path program 1 times [2025-03-04 00:30:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290923448] [2025-03-04 00:30:56,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:56,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:30:56,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:30:56,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:30:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290923448] [2025-03-04 00:30:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290923448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131831978] [2025-03-04 00:30:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:57,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:57,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:57,207 INFO L87 Difference]: Start difference. First operand 25851 states and 41715 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:58,646 INFO L93 Difference]: Finished difference Result 75647 states and 120951 transitions. [2025-03-04 00:30:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:30:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:58,755 INFO L225 Difference]: With dead ends: 75647 [2025-03-04 00:30:58,755 INFO L226 Difference]: Without dead ends: 49799 [2025-03-04 00:30:58,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:58,790 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 658 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:58,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1504 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49799 states. [2025-03-04 00:30:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49799 to 26355. [2025-03-04 00:30:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26355 states, 24764 states have (on average 1.599095461153287) internal successors, (39600), 24842 states have internal predecessors, (39600), 1446 states have call successors, (1446), 144 states have call predecessors, (1446), 144 states have return successors, (1446), 1368 states have call predecessors, (1446), 1446 states have call successors, (1446) [2025-03-04 00:30:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26355 states to 26355 states and 42492 transitions. [2025-03-04 00:30:59,789 INFO L78 Accepts]: Start accepts. Automaton has 26355 states and 42492 transitions. Word has length 494 [2025-03-04 00:30:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:59,790 INFO L471 AbstractCegarLoop]: Abstraction has 26355 states and 42492 transitions. [2025-03-04 00:30:59,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:30:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 26355 states and 42492 transitions. [2025-03-04 00:30:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:30:59,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:59,817 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] [2025-03-04 00:30:59,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:30:59,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:59,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash 102937430, now seen corresponding path program 1 times [2025-03-04 00:30:59,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599383503] [2025-03-04 00:30:59,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:59,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:31:00,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:31:00,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:00,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:31:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599383503] [2025-03-04 00:31:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599383503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56356993] [2025-03-04 00:31:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:00,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:00,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:00,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:00,715 INFO L87 Difference]: Start difference. First operand 26355 states and 42492 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:02,012 INFO L93 Difference]: Finished difference Result 78321 states and 126258 transitions. [2025-03-04 00:31:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:02,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:31:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:02,110 INFO L225 Difference]: With dead ends: 78321 [2025-03-04 00:31:02,110 INFO L226 Difference]: Without dead ends: 51969 [2025-03-04 00:31:02,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:02,140 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 283 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:02,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1183 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51969 states. [2025-03-04 00:31:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51969 to 51961. [2025-03-04 00:31:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51961 states, 48984 states have (on average 1.5961538461538463) internal successors, (78186), 49146 states have internal predecessors, (78186), 2688 states have call successors, (2688), 288 states have call predecessors, (2688), 288 states have return successors, (2688), 2526 states have call predecessors, (2688), 2688 states have call successors, (2688) [2025-03-04 00:31:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51961 states to 51961 states and 83562 transitions. [2025-03-04 00:31:04,174 INFO L78 Accepts]: Start accepts. Automaton has 51961 states and 83562 transitions. Word has length 494 [2025-03-04 00:31:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:04,175 INFO L471 AbstractCegarLoop]: Abstraction has 51961 states and 83562 transitions. [2025-03-04 00:31:04,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 51961 states and 83562 transitions. [2025-03-04 00:31:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:31:04,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:04,223 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] [2025-03-04 00:31:04,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:31:04,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1907166411, now seen corresponding path program 1 times [2025-03-04 00:31:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:04,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839546665] [2025-03-04 00:31:04,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:04,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:31:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:31:07,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:07,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 57 proven. 159 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:31:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839546665] [2025-03-04 00:31:07,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839546665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:07,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277414057] [2025-03-04 00:31:07,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:07,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:07,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:31:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:31:07,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:31:07,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:07,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:07,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:31:07,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 1951 proven. 195 refuted. 0 times theorem prover too weak. 8366 trivial. 0 not checked. [2025-03-04 00:31:09,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 21 proven. 195 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:31:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277414057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:10,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-03-04 00:31:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041994679] [2025-03-04 00:31:10,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:10,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:31:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:10,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:31:10,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:31:10,476 INFO L87 Difference]: Start difference. First operand 51961 states and 83562 transitions. Second operand has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-03-04 00:31:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:13,354 INFO L93 Difference]: Finished difference Result 95707 states and 152387 transitions. [2025-03-04 00:31:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 00:31:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) Word has length 494 [2025-03-04 00:31:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:13,461 INFO L225 Difference]: With dead ends: 95707 [2025-03-04 00:31:13,461 INFO L226 Difference]: Without dead ends: 43709 [2025-03-04 00:31:13,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=1167, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 00:31:13,509 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 2262 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:13,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2262 Valid, 1817 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:31:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43709 states. [2025-03-04 00:31:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43709 to 28273. [2025-03-04 00:31:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28273 states, 25584 states have (on average 1.568792995622264) internal successors, (40136), 25707 states have internal predecessors, (40136), 2376 states have call successors, (2376), 312 states have call predecessors, (2376), 312 states have return successors, (2376), 2253 states have call predecessors, (2376), 2376 states have call successors, (2376) [2025-03-04 00:31:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28273 states to 28273 states and 44888 transitions. [2025-03-04 00:31:14,949 INFO L78 Accepts]: Start accepts. Automaton has 28273 states and 44888 transitions. Word has length 494 [2025-03-04 00:31:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:14,950 INFO L471 AbstractCegarLoop]: Abstraction has 28273 states and 44888 transitions. [2025-03-04 00:31:14,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 19.294117647058822) internal successors, (328), 17 states have internal predecessors, (328), 8 states have call successors, (219), 4 states have call predecessors, (219), 7 states have return successors, (219), 8 states have call predecessors, (219), 8 states have call successors, (219) [2025-03-04 00:31:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 28273 states and 44888 transitions. [2025-03-04 00:31:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:31:14,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:14,971 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] [2025-03-04 00:31:14,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:31:15,171 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,SelfDestructingSolverStorable9 [2025-03-04 00:31:15,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:15,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash 727602743, now seen corresponding path program 1 times [2025-03-04 00:31:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060160643] [2025-03-04 00:31:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:15,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:31:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:31:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:31:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060160643] [2025-03-04 00:31:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060160643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:15,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:15,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681650931] [2025-03-04 00:31:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:15,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:15,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:15,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:15,933 INFO L87 Difference]: Start difference. First operand 28273 states and 44888 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:16,644 INFO L93 Difference]: Finished difference Result 41097 states and 65267 transitions. [2025-03-04 00:31:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:16,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:31:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:16,684 INFO L225 Difference]: With dead ends: 41097 [2025-03-04 00:31:16,685 INFO L226 Difference]: Without dead ends: 12827 [2025-03-04 00:31:16,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:16,719 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 431 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:16,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1166 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12827 states. [2025-03-04 00:31:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12827 to 12797. [2025-03-04 00:31:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12797 states, 11014 states have (on average 1.5331396404575994) internal successors, (16886), 11066 states have internal predecessors, (16886), 1621 states have call successors, (1621), 161 states have call predecessors, (1621), 161 states have return successors, (1621), 1569 states have call predecessors, (1621), 1621 states have call successors, (1621) [2025-03-04 00:31:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12797 states to 12797 states and 20128 transitions. [2025-03-04 00:31:17,476 INFO L78 Accepts]: Start accepts. Automaton has 12797 states and 20128 transitions. Word has length 494 [2025-03-04 00:31:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:17,476 INFO L471 AbstractCegarLoop]: Abstraction has 12797 states and 20128 transitions. [2025-03-04 00:31:17,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 12797 states and 20128 transitions. [2025-03-04 00:31:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:31:17,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:17,483 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] [2025-03-04 00:31:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:31:17,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:17,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash -129153066, now seen corresponding path program 1 times [2025-03-04 00:31:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066431162] [2025-03-04 00:31:17,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:17,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:31:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:31:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:31:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066431162] [2025-03-04 00:31:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066431162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:31:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066858157] [2025-03-04 00:31:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:31:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:18,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:31:18,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:31:18,819 INFO L87 Difference]: Start difference. First operand 12797 states and 20128 transitions. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-04 00:31:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:22,971 INFO L93 Difference]: Finished difference Result 41135 states and 64654 transitions. [2025-03-04 00:31:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:31:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 494 [2025-03-04 00:31:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:23,042 INFO L225 Difference]: With dead ends: 41135 [2025-03-04 00:31:23,042 INFO L226 Difference]: Without dead ends: 28477 [2025-03-04 00:31:23,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:31:23,069 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 2435 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2435 SdHoareTripleChecker+Valid, 5052 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:23,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2435 Valid, 5052 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:31:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28477 states. [2025-03-04 00:31:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28477 to 19324. [2025-03-04 00:31:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19324 states, 17457 states have (on average 1.5428767829523973) internal successors, (26934), 17521 states have internal predecessors, (26934), 1681 states have call successors, (1681), 185 states have call predecessors, (1681), 185 states have return successors, (1681), 1617 states have call predecessors, (1681), 1681 states have call successors, (1681) [2025-03-04 00:31:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19324 states to 19324 states and 30296 transitions. [2025-03-04 00:31:24,139 INFO L78 Accepts]: Start accepts. Automaton has 19324 states and 30296 transitions. Word has length 494 [2025-03-04 00:31:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:24,140 INFO L471 AbstractCegarLoop]: Abstraction has 19324 states and 30296 transitions. [2025-03-04 00:31:24,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-04 00:31:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19324 states and 30296 transitions. [2025-03-04 00:31:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-04 00:31:24,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:24,152 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] [2025-03-04 00:31:24,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:31:24,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:24,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1378398743, now seen corresponding path program 1 times [2025-03-04 00:31:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501162335] [2025-03-04 00:31:24,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:24,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-04 00:31:24,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-04 00:31:24,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:24,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:31:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501162335] [2025-03-04 00:31:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501162335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:24,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:24,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:24,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489063945] [2025-03-04 00:31:24,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:24,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:24,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:24,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:24,638 INFO L87 Difference]: Start difference. First operand 19324 states and 30296 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:25,761 INFO L93 Difference]: Finished difference Result 54400 states and 85661 transitions. [2025-03-04 00:31:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 494 [2025-03-04 00:31:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:25,814 INFO L225 Difference]: With dead ends: 54400 [2025-03-04 00:31:25,815 INFO L226 Difference]: Without dead ends: 35215 [2025-03-04 00:31:25,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:25,831 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 511 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:25,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1434 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35215 states. [2025-03-04 00:31:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35215 to 34059. [2025-03-04 00:31:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34059 states, 31616 states have (on average 1.563448886639676) internal successors, (49430), 31701 states have internal predecessors, (49430), 2209 states have call successors, (2209), 233 states have call predecessors, (2209), 233 states have return successors, (2209), 2124 states have call predecessors, (2209), 2209 states have call successors, (2209) [2025-03-04 00:31:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34059 states to 34059 states and 53848 transitions. [2025-03-04 00:31:26,893 INFO L78 Accepts]: Start accepts. Automaton has 34059 states and 53848 transitions. Word has length 494 [2025-03-04 00:31:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:26,894 INFO L471 AbstractCegarLoop]: Abstraction has 34059 states and 53848 transitions. [2025-03-04 00:31:26,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34059 states and 53848 transitions. [2025-03-04 00:31:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-04 00:31:26,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:26,908 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] [2025-03-04 00:31:26,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:31:26,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:26,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1857130922, now seen corresponding path program 1 times [2025-03-04 00:31:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:26,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796246825] [2025-03-04 00:31:26,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:26,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-04 00:31:27,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-04 00:31:27,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:27,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-04 00:31:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796246825] [2025-03-04 00:31:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796246825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070042675] [2025-03-04 00:31:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:27,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:27,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:27,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:27,956 INFO L87 Difference]: Start difference. First operand 34059 states and 53848 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:29,382 INFO L93 Difference]: Finished difference Result 70967 states and 111718 transitions. [2025-03-04 00:31:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:29,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 495 [2025-03-04 00:31:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:29,450 INFO L225 Difference]: With dead ends: 70967 [2025-03-04 00:31:29,450 INFO L226 Difference]: Without dead ends: 37047 [2025-03-04 00:31:29,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:29,493 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 748 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:29,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2127 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2025-03-04 00:31:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 34467. [2025-03-04 00:31:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34467 states, 31864 states have (on average 1.5463846346974641) internal successors, (49274), 31957 states have internal predecessors, (49274), 2353 states have call successors, (2353), 249 states have call predecessors, (2353), 249 states have return successors, (2353), 2260 states have call predecessors, (2353), 2353 states have call successors, (2353) [2025-03-04 00:31:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34467 states to 34467 states and 53980 transitions. [2025-03-04 00:31:30,782 INFO L78 Accepts]: Start accepts. Automaton has 34467 states and 53980 transitions. Word has length 495 [2025-03-04 00:31:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:30,783 INFO L471 AbstractCegarLoop]: Abstraction has 34467 states and 53980 transitions. [2025-03-04 00:31:30,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-04 00:31:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34467 states and 53980 transitions. [2025-03-04 00:31:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-04 00:31:30,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:30,796 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] [2025-03-04 00:31:30,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:31:30,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:30,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash -395550923, now seen corresponding path program 1 times [2025-03-04 00:31:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544748934] [2025-03-04 00:31:30,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:30,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-04 00:31:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-04 00:31:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 15 proven. 201 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:31:34,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544748934] [2025-03-04 00:31:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544748934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298105368] [2025-03-04 00:31:34,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:34,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:34,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:34,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:31:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-04 00:31:34,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-04 00:31:34,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:34,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:34,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:31:34,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4516 proven. 150 refuted. 0 times theorem prover too weak. 5846 trivial. 0 not checked. [2025-03-04 00:31:35,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 66 proven. 150 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-04 00:31:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298105368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:36,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 8] total 33 [2025-03-04 00:31:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617952311] [2025-03-04 00:31:36,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:36,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 00:31:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 00:31:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:31:36,544 INFO L87 Difference]: Start difference. First operand 34467 states and 53980 transitions. Second operand has 33 states, 32 states have (on average 10.96875) internal successors, (351), 33 states have internal predecessors, (351), 10 states have call successors, (219), 3 states have call predecessors, (219), 6 states have return successors, (219), 9 states have call predecessors, (219), 10 states have call successors, (219)