./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-66.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_amount250_file-66.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 c0271c86359ca1321e131492680f0610c424530e37b1dccfbb85027d39387777 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:13:53,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:13:53,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:13:53,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:13:53,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:13:53,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:13:53,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:13:53,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:13:53,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:13:53,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:13:53,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:13:53,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:13:53,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:13:53,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:13:53,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:13:53,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:13:53,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:13:53,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:13:53,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:13:53,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:13:53,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:13:53,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:13:53,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:13:53,484 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 -> c0271c86359ca1321e131492680f0610c424530e37b1dccfbb85027d39387777 [2025-03-04 00:13:53,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:13:53,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:13:53,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:13:53,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:13:53,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:13:53,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-66.i [2025-03-04 00:13:54,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834f742d1/39556ec90c984229bbdf5a23e37d571a/FLAG78310b4db [2025-03-04 00:13:55,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:13:55,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-66.i [2025-03-04 00:13:55,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834f742d1/39556ec90c984229bbdf5a23e37d571a/FLAG78310b4db [2025-03-04 00:13:55,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834f742d1/39556ec90c984229bbdf5a23e37d571a [2025-03-04 00:13:55,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:13:55,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:13:55,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:55,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:13:55,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:13:55,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ffc96e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55, skipping insertion in model container [2025-03-04 00:13:55,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:13:55,480 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_amount250_file-66.i[916,929] [2025-03-04 00:13:55,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:13:55,606 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:13:55,618 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_amount250_file-66.i[916,929] [2025-03-04 00:13:55,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:13:55,705 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:13:55,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55 WrapperNode [2025-03-04 00:13:55,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:55,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:13:55,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:13:55,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:13:55,712 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:13:55" (1/1) ... [2025-03-04 00:13:55,727 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:13:55" (1/1) ... [2025-03-04 00:13:55,763 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2025-03-04 00:13:55,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:13:55,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:13:55,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:13:55,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:13:55,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,814 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:13:55,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:13:55,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:13:55,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:13:55,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:13:55,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (1/1) ... [2025-03-04 00:13:55,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:13:55,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:55,887 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:13:55,889 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:13:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:13:55,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:13:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:13:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:13:55,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:13:55,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:13:55,979 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:13:55,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:13:56,525 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: havoc property_#t~ite38#1;havoc property_#t~ite37#1;havoc property_#t~bitwise34#1;havoc property_#t~ite36#1;havoc property_#t~bitwise35#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~ite45#1;havoc property_#t~ite44#1;havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short46#1; [2025-03-04 00:13:56,574 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-04 00:13:56,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:13:56,592 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:13:56,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:13:56,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:13:56 BoogieIcfgContainer [2025-03-04 00:13:56,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:13:56,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:13:56,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:13:56,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:13:56,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:13:55" (1/3) ... [2025-03-04 00:13:56,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfd2bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:13:56, skipping insertion in model container [2025-03-04 00:13:56,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:55" (2/3) ... [2025-03-04 00:13:56,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dfd2bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:13:56, skipping insertion in model container [2025-03-04 00:13:56,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:13:56" (3/3) ... [2025-03-04 00:13:56,602 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-66.i [2025-03-04 00:13:56,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:13:56,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-66.i that has 2 procedures, 186 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:13:56,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:13:56,665 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;@7cb50a94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:13:56,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:13:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 141 states have internal predecessors, (211), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:13:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:13:56,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:56,679 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:56,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1366721238, now seen corresponding path program 1 times [2025-03-04 00:13:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308405419] [2025-03-04 00:13:56,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:56,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:13:56,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:13:56,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:56,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:13:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308405419] [2025-03-04 00:13:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308405419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962189386] [2025-03-04 00:13:57,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:57,087 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:13:57,088 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:13:57,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:13:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:13:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:57,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:13:57,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:13:57,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:13:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962189386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:57,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:13:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973289197] [2025-03-04 00:13:57,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:57,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:13:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:57,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:13:57,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:13:57,364 INFO L87 Difference]: Start difference. First operand has 186 states, 140 states have (on average 1.5071428571428571) internal successors, (211), 141 states have internal predecessors, (211), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:13:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:57,411 INFO L93 Difference]: Finished difference Result 366 states and 632 transitions. [2025-03-04 00:13:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:13:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 295 [2025-03-04 00:13:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:57,422 INFO L225 Difference]: With dead ends: 366 [2025-03-04 00:13:57,422 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 00:13:57,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 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:13:57,426 INFO L435 NwaCegarLoop]: 282 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, 282 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:13:57,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:13:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 00:13:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-04 00:13:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 138 states have (on average 1.4782608695652173) internal successors, (204), 138 states have internal predecessors, (204), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:13:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 290 transitions. [2025-03-04 00:13:57,473 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 290 transitions. Word has length 295 [2025-03-04 00:13:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:57,473 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 290 transitions. [2025-03-04 00:13:57,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:13:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 290 transitions. [2025-03-04 00:13:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:13:57,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:57,477 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:57,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:57,682 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:13:57,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 972589043, now seen corresponding path program 1 times [2025-03-04 00:13:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753229487] [2025-03-04 00:13:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:57,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:13:57,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:13:57,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:57,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:13:58,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:58,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753229487] [2025-03-04 00:13:58,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753229487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:58,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:58,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:13:58,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204242870] [2025-03-04 00:13:58,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:58,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:13:58,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:58,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:13:58,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:58,024 INFO L87 Difference]: Start difference. First operand 183 states and 290 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:13:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:58,149 INFO L93 Difference]: Finished difference Result 529 states and 842 transitions. [2025-03-04 00:13:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:13:58,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 295 [2025-03-04 00:13:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:58,154 INFO L225 Difference]: With dead ends: 529 [2025-03-04 00:13:58,156 INFO L226 Difference]: Without dead ends: 349 [2025-03-04 00:13:58,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:58,158 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 252 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:58,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 637 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:13:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-04 00:13:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 217. [2025-03-04 00:13:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.494186046511628) internal successors, (257), 172 states have internal predecessors, (257), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:13:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2025-03-04 00:13:58,188 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 295 [2025-03-04 00:13:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:58,190 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2025-03-04 00:13:58,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:13:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2025-03-04 00:13:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 00:13:58,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:58,197 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:13:58,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:58,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1003608850, now seen corresponding path program 1 times [2025-03-04 00:13:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511100422] [2025-03-04 00:13:58,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:58,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 00:13:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 00:13:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:13:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511100422] [2025-03-04 00:13:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511100422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:59,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:13:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319155591] [2025-03-04 00:13:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:13:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:59,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:13:59,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:13:59,133 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:13:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:59,416 INFO L93 Difference]: Finished difference Result 692 states and 1102 transitions. [2025-03-04 00:13:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:13:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 295 [2025-03-04 00:13:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:59,419 INFO L225 Difference]: With dead ends: 692 [2025-03-04 00:13:59,420 INFO L226 Difference]: Without dead ends: 478 [2025-03-04 00:13:59,420 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:13:59,421 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 263 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:59,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 865 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:13:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-04 00:13:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 293. [2025-03-04 00:13:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 204 states have internal predecessors, (289), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:13:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 461 transitions. [2025-03-04 00:13:59,450 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 461 transitions. Word has length 295 [2025-03-04 00:13:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:59,450 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 461 transitions. [2025-03-04 00:13:59,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:13:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 461 transitions. [2025-03-04 00:13:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-04 00:13:59,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:59,453 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:13:59,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash -100839935, now seen corresponding path program 1 times [2025-03-04 00:13:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379286813] [2025-03-04 00:13:59,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:59,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 00:13:59,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 00:13:59,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:59,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:13:59,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:59,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379286813] [2025-03-04 00:13:59,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379286813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:59,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:59,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:13:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387654934] [2025-03-04 00:13:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:59,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:13:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:59,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:13:59,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:13:59,946 INFO L87 Difference]: Start difference. First operand 293 states and 461 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:14:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:00,253 INFO L93 Difference]: Finished difference Result 631 states and 985 transitions. [2025-03-04 00:14:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:14:00,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 296 [2025-03-04 00:14:00,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:00,257 INFO L225 Difference]: With dead ends: 631 [2025-03-04 00:14:00,257 INFO L226 Difference]: Without dead ends: 417 [2025-03-04 00:14:00,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:14:00,260 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 475 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:00,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 540 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:14:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-04 00:14:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 301. [2025-03-04 00:14:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 210 states have (on average 1.4) internal successors, (294), 210 states have internal predecessors, (294), 86 states have call successors, (86), 4 states have call predecessors, (86), 4 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:14:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 466 transitions. [2025-03-04 00:14:00,312 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 466 transitions. Word has length 296 [2025-03-04 00:14:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:00,313 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 466 transitions. [2025-03-04 00:14:00,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:14:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 466 transitions. [2025-03-04 00:14:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-04 00:14:00,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:00,316 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:14:00,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -430605696, now seen corresponding path program 1 times [2025-03-04 00:14:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:00,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371674145] [2025-03-04 00:14:00,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:00,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 00:14:00,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 00:14:00,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:00,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 33 proven. 93 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:14:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371674145] [2025-03-04 00:14:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371674145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076312642] [2025-03-04 00:14:01,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:01,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:01,217 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:14:01,219 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:14:01,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 00:14:01,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 00:14:01,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:01,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:01,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:14:01,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 844 proven. 219 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2025-03-04 00:14:02,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:14:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 27 proven. 222 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2025-03-04 00:14:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076312642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:14:03,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:14:03,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2025-03-04 00:14:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826459786] [2025-03-04 00:14:03,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:14:03,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:14:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:03,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:14:03,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:14:03,234 INFO L87 Difference]: Start difference. First operand 301 states and 466 transitions. Second operand has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 5 states have call successors, (124), 3 states have call predecessors, (124), 7 states have return successors, (125), 5 states have call predecessors, (125), 5 states have call successors, (125) [2025-03-04 00:14:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:03,896 INFO L93 Difference]: Finished difference Result 547 states and 830 transitions. [2025-03-04 00:14:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:14:03,897 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 5 states have call successors, (124), 3 states have call predecessors, (124), 7 states have return successors, (125), 5 states have call predecessors, (125), 5 states have call successors, (125) Word has length 296 [2025-03-04 00:14:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:03,902 INFO L225 Difference]: With dead ends: 547 [2025-03-04 00:14:03,902 INFO L226 Difference]: Without dead ends: 329 [2025-03-04 00:14:03,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 585 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:14:03,904 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 962 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:03,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 821 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:14:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-04 00:14:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2025-03-04 00:14:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 228 states have (on average 1.3508771929824561) internal successors, (308), 228 states have internal predecessors, (308), 86 states have call successors, (86), 10 states have call predecessors, (86), 10 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:14:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 480 transitions. [2025-03-04 00:14:03,943 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 480 transitions. Word has length 296 [2025-03-04 00:14:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:03,943 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 480 transitions. [2025-03-04 00:14:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 5 states have call successors, (124), 3 states have call predecessors, (124), 7 states have return successors, (125), 5 states have call predecessors, (125), 5 states have call successors, (125) [2025-03-04 00:14:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 480 transitions. [2025-03-04 00:14:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:14:03,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:03,948 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:14:04,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:04,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:04,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1635658147, now seen corresponding path program 1 times [2025-03-04 00:14:04,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:04,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776760629] [2025-03-04 00:14:04,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:04,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:04,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:14:04,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:14:04,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:04,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 6 proven. 120 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:14:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776760629] [2025-03-04 00:14:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776760629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101594192] [2025-03-04 00:14:04,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:04,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:04,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:04,772 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:14:04,774 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:14:04,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:14:04,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:14:04,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:04,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:04,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:14:04,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 366 proven. 120 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-03-04 00:14:05,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:14:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 6 proven. 120 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:14:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101594192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:14:05,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:14:05,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 00:14:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31390262] [2025-03-04 00:14:05,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:14:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:14:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:05,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:14:05,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:14:05,561 INFO L87 Difference]: Start difference. First operand 325 states and 480 transitions. Second operand has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 4 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (125), 4 states have call predecessors, (125), 4 states have call successors, (125) [2025-03-04 00:14:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:05,834 INFO L93 Difference]: Finished difference Result 567 states and 837 transitions. [2025-03-04 00:14:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:14:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 4 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (125), 4 states have call predecessors, (125), 4 states have call successors, (125) Word has length 297 [2025-03-04 00:14:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:05,839 INFO L225 Difference]: With dead ends: 567 [2025-03-04 00:14:05,839 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 00:14:05,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:14:05,840 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 341 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:05,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 581 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:14:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 00:14:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2025-03-04 00:14:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 234 states have (on average 1.3376068376068375) internal successors, (313), 234 states have internal predecessors, (313), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:14:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 485 transitions. [2025-03-04 00:14:05,876 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 485 transitions. Word has length 297 [2025-03-04 00:14:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 485 transitions. [2025-03-04 00:14:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 4 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (125), 4 states have call predecessors, (125), 4 states have call successors, (125) [2025-03-04 00:14:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 485 transitions. [2025-03-04 00:14:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:14:05,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:05,878 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:05,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:14:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:06,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1395118018, now seen corresponding path program 1 times [2025-03-04 00:14:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3850639] [2025-03-04 00:14:06,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:14:06,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:14:06,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:06,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:14:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3850639] [2025-03-04 00:14:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3850639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:14:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:14:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:14:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795050406] [2025-03-04 00:14:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:14:06,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:14:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:06,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:14:06,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:14:06,256 INFO L87 Difference]: Start difference. First operand 333 states and 485 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:14:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:06,345 INFO L93 Difference]: Finished difference Result 801 states and 1183 transitions. [2025-03-04 00:14:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:14:06,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-03-04 00:14:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:06,351 INFO L225 Difference]: With dead ends: 801 [2025-03-04 00:14:06,352 INFO L226 Difference]: Without dead ends: 567 [2025-03-04 00:14:06,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:14:06,353 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 199 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:06,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 796 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:14:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-04 00:14:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2025-03-04 00:14:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 417 states have (on average 1.3741007194244603) internal successors, (573), 417 states have internal predecessors, (573), 129 states have call successors, (129), 18 states have call predecessors, (129), 18 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 00:14:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 831 transitions. [2025-03-04 00:14:06,407 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 831 transitions. Word has length 297 [2025-03-04 00:14:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:06,407 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 831 transitions. [2025-03-04 00:14:06,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:14:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 831 transitions. [2025-03-04 00:14:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-04 00:14:06,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:06,410 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:06,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:14:06,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1856911793, now seen corresponding path program 1 times [2025-03-04 00:14:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065351868] [2025-03-04 00:14:06,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:06,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:14:06,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:14:06,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:06,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 204 proven. 366 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-04 00:14:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065351868] [2025-03-04 00:14:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065351868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113995689] [2025-03-04 00:14:07,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:07,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:14:07,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:14:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:14:08,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:14:08,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:08,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:08,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 00:14:08,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2227 proven. 612 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2025-03-04 00:14:11,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:14:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113995689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:13,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:14:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 40 [2025-03-04 00:14:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884546966] [2025-03-04 00:14:13,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:14:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 00:14:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:13,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 00:14:13,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=2709, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 00:14:13,498 INFO L87 Difference]: Start difference. First operand 565 states and 831 transitions. Second operand has 40 states, 38 states have (on average 4.7894736842105265) internal successors, (182), 35 states have internal predecessors, (182), 16 states have call successors, (86), 10 states have call predecessors, (86), 15 states have return successors, (86), 15 states have call predecessors, (86), 16 states have call successors, (86) [2025-03-04 00:14:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:15,345 INFO L93 Difference]: Finished difference Result 1242 states and 1787 transitions. [2025-03-04 00:14:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 00:14:15,346 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 4.7894736842105265) internal successors, (182), 35 states have internal predecessors, (182), 16 states have call successors, (86), 10 states have call predecessors, (86), 15 states have return successors, (86), 15 states have call predecessors, (86), 16 states have call successors, (86) Word has length 298 [2025-03-04 00:14:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:15,350 INFO L225 Difference]: With dead ends: 1242 [2025-03-04 00:14:15,350 INFO L226 Difference]: Without dead ends: 776 [2025-03-04 00:14:15,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1198, Invalid=3914, Unknown=0, NotChecked=0, Total=5112 [2025-03-04 00:14:15,353 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1706 mSDsluCounter, 2894 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:15,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 3096 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:14:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-04 00:14:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 690. [2025-03-04 00:14:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.3530534351145038) internal successors, (709), 524 states have internal predecessors, (709), 129 states have call successors, (129), 36 states have call predecessors, (129), 36 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 00:14:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 967 transitions. [2025-03-04 00:14:15,418 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 967 transitions. Word has length 298 [2025-03-04 00:14:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:15,418 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 967 transitions. [2025-03-04 00:14:15,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 4.7894736842105265) internal successors, (182), 35 states have internal predecessors, (182), 16 states have call successors, (86), 10 states have call predecessors, (86), 15 states have return successors, (86), 15 states have call predecessors, (86), 16 states have call successors, (86) [2025-03-04 00:14:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 967 transitions. [2025-03-04 00:14:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-04 00:14:15,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:15,423 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:14:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:15,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash -108201111, now seen corresponding path program 1 times [2025-03-04 00:14:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443120609] [2025-03-04 00:14:15,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:15,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:14:15,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:14:15,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:15,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:14:15,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577106750] [2025-03-04 00:14:15,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:15,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:14:15,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:14:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-04 00:14:53,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-04 00:14:53,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:53,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:14:53,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:14:53,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes.