./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-12.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-12.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 aa3ed2bff1e00689dc57bff3bbe0e8e59870786f79090b55555fbd2dfd8e804d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:18,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:18,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:18,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:18,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:18,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:18,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:18,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:18,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:18,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:18,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:18,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:18,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:18,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:18,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:18,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:18,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:18,662 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 -> aa3ed2bff1e00689dc57bff3bbe0e8e59870786f79090b55555fbd2dfd8e804d [2025-03-04 00:07:18,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:18,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:18,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:18,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:18,890 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:18,891 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-12.i [2025-03-04 00:07:20,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a127f133/84b76551de5541bb8be92dd94a08de7e/FLAG84bd5b4d3 [2025-03-04 00:07:20,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:20,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-12.i [2025-03-04 00:07:20,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a127f133/84b76551de5541bb8be92dd94a08de7e/FLAG84bd5b4d3 [2025-03-04 00:07:20,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a127f133/84b76551de5541bb8be92dd94a08de7e [2025-03-04 00:07:20,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:20,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:20,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:20,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:20,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:20,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:20" (1/1) ... [2025-03-04 00:07:20,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:20, skipping insertion in model container [2025-03-04 00:07:20,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:20" (1/1) ... [2025-03-04 00:07:20,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:20,743 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-12.i[916,929] [2025-03-04 00:07:20,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:20,912 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:20,923 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-12.i[916,929] [2025-03-04 00:07:21,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:21,024 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:21,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21 WrapperNode [2025-03-04 00:07:21,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:21,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:21,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:21,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:21,031 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:07:21" (1/1) ... [2025-03-04 00:07:21,045 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:07:21" (1/1) ... [2025-03-04 00:07:21,108 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2025-03-04 00:07:21,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:21,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:21,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:21,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:21,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,168 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:07:21,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:21,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:21,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:21,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:21,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (1/1) ... [2025-03-04 00:07:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:21,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:21,251 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:07:21,257 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:07:21,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:21,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:21,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:21,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:21,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:21,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:21,361 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:21,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:21,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: havoc property_#t~ite43#1;havoc property_#t~ite42#1;havoc property_#t~bitwise39#1;havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short44#1;havoc property_#t~ite49#1;havoc property_#t~ite48#1;havoc property_#t~bitwise45#1;havoc property_#t~ite47#1;havoc property_#t~bitwise46#1;havoc property_#t~short50#1; [2025-03-04 00:07:21,995 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:21,996 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:22,017 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:22,019 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:22,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:22 BoogieIcfgContainer [2025-03-04 00:07:22,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:22,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:22,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:22,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:22,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:20" (1/3) ... [2025-03-04 00:07:22,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c722d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:22, skipping insertion in model container [2025-03-04 00:07:22,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:21" (2/3) ... [2025-03-04 00:07:22,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c722d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:22, skipping insertion in model container [2025-03-04 00:07:22,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:22" (3/3) ... [2025-03-04 00:07:22,027 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-12.i [2025-03-04 00:07:22,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:22,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-12.i that has 2 procedures, 187 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:22,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:22,101 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;@39ecbf12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:22,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 136 states have internal predecessors, (198), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-04 00:07:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:07:22,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:22,122 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:22,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1948502216, now seen corresponding path program 1 times [2025-03-04 00:07:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:22,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214370992] [2025-03-04 00:07:22,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:22,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:22,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:22,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:22,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:22,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:07:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214370992] [2025-03-04 00:07:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214370992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:23,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:07:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417008647] [2025-03-04 00:07:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:23,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:07:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:23,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:07:23,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:23,555 INFO L87 Difference]: Start difference. First operand has 187 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 136 states have internal predecessors, (198), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:23,857 INFO L93 Difference]: Finished difference Result 513 states and 920 transitions. [2025-03-04 00:07:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:23,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 317 [2025-03-04 00:07:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:23,868 INFO L225 Difference]: With dead ends: 513 [2025-03-04 00:07:23,869 INFO L226 Difference]: Without dead ends: 329 [2025-03-04 00:07:23,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:07:23,877 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 171 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:23,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 643 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-04 00:07:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2025-03-04 00:07:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 225 states have internal predecessors, (319), 98 states have call successors, (98), 2 states have call predecessors, (98), 2 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 00:07:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 515 transitions. [2025-03-04 00:07:23,967 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 515 transitions. Word has length 317 [2025-03-04 00:07:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:23,968 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 515 transitions. [2025-03-04 00:07:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 515 transitions. [2025-03-04 00:07:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:07:23,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:23,977 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:23,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:07:23,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1320973081, now seen corresponding path program 1 times [2025-03-04 00:07:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556305108] [2025-03-04 00:07:23,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:24,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:24,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:24,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:07:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556305108] [2025-03-04 00:07:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556305108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:07:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390843835] [2025-03-04 00:07:25,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:25,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:07:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:25,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:07:25,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:25,236 INFO L87 Difference]: Start difference. First operand 326 states and 515 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:25,567 INFO L93 Difference]: Finished difference Result 1011 states and 1577 transitions. [2025-03-04 00:07:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:07:25,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 317 [2025-03-04 00:07:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:25,573 INFO L225 Difference]: With dead ends: 1011 [2025-03-04 00:07:25,573 INFO L226 Difference]: Without dead ends: 688 [2025-03-04 00:07:25,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:25,575 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 254 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:25,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 799 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:07:25,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-04 00:07:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 554. [2025-03-04 00:07:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 419 states have (on average 1.4439140811455846) internal successors, (605), 421 states have internal predecessors, (605), 130 states have call successors, (130), 4 states have call predecessors, (130), 4 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 00:07:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 865 transitions. [2025-03-04 00:07:25,632 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 865 transitions. Word has length 317 [2025-03-04 00:07:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:25,632 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 865 transitions. [2025-03-04 00:07:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-04 00:07:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 865 transitions. [2025-03-04 00:07:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 00:07:25,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:25,641 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:25,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:25,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:25,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1258900936, now seen corresponding path program 1 times [2025-03-04 00:07:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:25,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813815253] [2025-03-04 00:07:25,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:25,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:26,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:26,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:26,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 27 proven. 117 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 00:07:26,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:26,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813815253] [2025-03-04 00:07:26,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813815253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029181221] [2025-03-04 00:07:26,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:26,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:26,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:26,680 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:07:26,682 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:07:26,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-04 00:07:26,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-04 00:07:26,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:26,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:26,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:07:26,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 2128 proven. 96 refuted. 0 times theorem prover too weak. 2480 trivial. 0 not checked. [2025-03-04 00:07:27,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 48 proven. 96 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 00:07:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029181221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:27,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:27,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 14 [2025-03-04 00:07:27,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575430645] [2025-03-04 00:07:27,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:07:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:27,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:07:27,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:07:27,762 INFO L87 Difference]: Start difference. First operand 554 states and 865 transitions. Second operand has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 4 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 4 states have call predecessors, (131), 4 states have call successors, (131) [2025-03-04 00:07:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:29,838 INFO L93 Difference]: Finished difference Result 1512 states and 2337 transitions. [2025-03-04 00:07:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-04 00:07:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 4 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 4 states have call predecessors, (131), 4 states have call successors, (131) Word has length 317 [2025-03-04 00:07:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:29,849 INFO L225 Difference]: With dead ends: 1512 [2025-03-04 00:07:29,850 INFO L226 Difference]: Without dead ends: 961 [2025-03-04 00:07:29,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 632 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=1922, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 00:07:29,854 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1758 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:29,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 2300 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:07:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-03-04 00:07:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 685. [2025-03-04 00:07:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 512 states have (on average 1.4140625) internal successors, (724), 513 states have internal predecessors, (724), 163 states have call successors, (163), 9 states have call predecessors, (163), 9 states have return successors, (163), 162 states have call predecessors, (163), 163 states have call successors, (163) [2025-03-04 00:07:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1050 transitions. [2025-03-04 00:07:29,942 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1050 transitions. Word has length 317 [2025-03-04 00:07:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:29,944 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1050 transitions. [2025-03-04 00:07:29,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 4 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 4 states have call predecessors, (131), 4 states have call successors, (131) [2025-03-04 00:07:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1050 transitions. [2025-03-04 00:07:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 00:07:29,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:29,947 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,956 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:07:30,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:30,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:30,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1047648201, now seen corresponding path program 1 times [2025-03-04 00:07:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056401015] [2025-03-04 00:07:30,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:30,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 00:07:30,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 00:07:30,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:30,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-04 00:07:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056401015] [2025-03-04 00:07:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056401015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:30,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:30,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:07:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521438109] [2025-03-04 00:07:30,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:30,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:07:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:30,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:07:30,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:07:30,414 INFO L87 Difference]: Start difference. First operand 685 states and 1050 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:07:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:30,741 INFO L93 Difference]: Finished difference Result 2020 states and 3116 transitions. [2025-03-04 00:07:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:07:30,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 319 [2025-03-04 00:07:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:30,749 INFO L225 Difference]: With dead ends: 2020 [2025-03-04 00:07:30,750 INFO L226 Difference]: Without dead ends: 1449 [2025-03-04 00:07:30,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:07:30,752 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 376 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:30,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1409 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-03-04 00:07:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1183. [2025-03-04 00:07:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 891 states have (on average 1.4197530864197532) internal successors, (1265), 893 states have internal predecessors, (1265), 277 states have call successors, (277), 14 states have call predecessors, (277), 14 states have return successors, (277), 275 states have call predecessors, (277), 277 states have call successors, (277) [2025-03-04 00:07:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1819 transitions. [2025-03-04 00:07:30,881 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1819 transitions. Word has length 319 [2025-03-04 00:07:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:30,884 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1819 transitions. [2025-03-04 00:07:30,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-04 00:07:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1819 transitions. [2025-03-04 00:07:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 00:07:30,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:30,890 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:30,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:07:30,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:30,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 717882440, now seen corresponding path program 1 times [2025-03-04 00:07:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:30,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038205453] [2025-03-04 00:07:30,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:30,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 00:07:31,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 00:07:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 48 proven. 96 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 00:07:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038205453] [2025-03-04 00:07:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038205453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892487335] [2025-03-04 00:07:31,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:31,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:31,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:31,638 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:07:31,640 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:07:31,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 00:07:31,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 00:07:31,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:31,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:31,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:07:31,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 2162 proven. 186 refuted. 0 times theorem prover too weak. 2356 trivial. 0 not checked. [2025-03-04 00:07:32,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 48 proven. 96 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 00:07:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892487335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:32,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-03-04 00:07:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514364752] [2025-03-04 00:07:32,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:32,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:07:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:32,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:07:32,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:07:32,479 INFO L87 Difference]: Start difference. First operand 1183 states and 1819 transitions. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 3 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2025-03-04 00:07:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:32,898 INFO L93 Difference]: Finished difference Result 2173 states and 3323 transitions. [2025-03-04 00:07:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:07:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 3 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) Word has length 319 [2025-03-04 00:07:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:32,906 INFO L225 Difference]: With dead ends: 2173 [2025-03-04 00:07:32,908 INFO L226 Difference]: Without dead ends: 1221 [2025-03-04 00:07:32,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 629 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:07:32,913 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 370 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:32,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1045 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:07:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-04 00:07:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1203. [2025-03-04 00:07:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 906 states have (on average 1.4061810154525387) internal successors, (1274), 908 states have internal predecessors, (1274), 277 states have call successors, (277), 19 states have call predecessors, (277), 19 states have return successors, (277), 275 states have call predecessors, (277), 277 states have call successors, (277) [2025-03-04 00:07:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1828 transitions. [2025-03-04 00:07:33,014 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1828 transitions. Word has length 319 [2025-03-04 00:07:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:33,015 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1828 transitions. [2025-03-04 00:07:33,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 3 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2025-03-04 00:07:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1828 transitions. [2025-03-04 00:07:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 00:07:33,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:33,019 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:33,027 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:07:33,219 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:07:33,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1297250605, now seen corresponding path program 1 times [2025-03-04 00:07:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028159288] [2025-03-04 00:07:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:07:33,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:07:33,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:33,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2025-03-04 00:07:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028159288] [2025-03-04 00:07:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028159288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921159323] [2025-03-04 00:07:33,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:33,862 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:07:33,864 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:07:33,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 00:07:34,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 00:07:34,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:34,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:34,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 00:07:34,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 3106 proven. 405 refuted. 0 times theorem prover too weak. 1193 trivial. 0 not checked. [2025-03-04 00:07:36,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 402 proven. 288 refuted. 0 times theorem prover too weak. 4014 trivial. 0 not checked. [2025-03-04 00:07:37,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921159323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:37,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:37,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 26, 19] total 46 [2025-03-04 00:07:37,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117217516] [2025-03-04 00:07:37,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:37,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 00:07:37,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:37,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 00:07:37,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1484, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 00:07:37,438 INFO L87 Difference]: Start difference. First operand 1203 states and 1828 transitions. Second operand has 46 states, 44 states have (on average 4.818181818181818) internal successors, (212), 41 states have internal predecessors, (212), 14 states have call successors, (110), 8 states have call predecessors, (110), 15 states have return successors, (112), 14 states have call predecessors, (112), 14 states have call successors, (112) [2025-03-04 00:07:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:40,452 INFO L93 Difference]: Finished difference Result 3715 states and 5351 transitions. [2025-03-04 00:07:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-04 00:07:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 4.818181818181818) internal successors, (212), 41 states have internal predecessors, (212), 14 states have call successors, (110), 8 states have call predecessors, (110), 15 states have return successors, (112), 14 states have call predecessors, (112), 14 states have call successors, (112) Word has length 320 [2025-03-04 00:07:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:40,471 INFO L225 Difference]: With dead ends: 3715 [2025-03-04 00:07:40,471 INFO L226 Difference]: Without dead ends: 3207 [2025-03-04 00:07:40,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2553, Invalid=7953, Unknown=0, NotChecked=0, Total=10506 [2025-03-04 00:07:40,477 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 1088 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:40,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2408 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:07:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-04 00:07:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 1669. [2025-03-04 00:07:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1271 states have (on average 1.3556254917387884) internal successors, (1723), 1275 states have internal predecessors, (1723), 329 states have call successors, (329), 68 states have call predecessors, (329), 68 states have return successors, (329), 325 states have call predecessors, (329), 329 states have call successors, (329) [2025-03-04 00:07:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2381 transitions. [2025-03-04 00:07:40,650 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2381 transitions. Word has length 320 [2025-03-04 00:07:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:40,651 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2381 transitions. [2025-03-04 00:07:40,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 4.818181818181818) internal successors, (212), 41 states have internal predecessors, (212), 14 states have call successors, (110), 8 states have call predecessors, (110), 15 states have return successors, (112), 14 states have call predecessors, (112), 14 states have call successors, (112) [2025-03-04 00:07:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2381 transitions. [2025-03-04 00:07:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 00:07:40,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:40,656 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:40,665 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:07:40,856 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:07:40,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1774435650, now seen corresponding path program 1 times [2025-03-04 00:07:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373488739] [2025-03-04 00:07:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:40,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 00:07:41,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 00:07:41,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 417 proven. 465 refuted. 0 times theorem prover too weak. 3822 trivial. 0 not checked. [2025-03-04 00:07:43,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373488739] [2025-03-04 00:07:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373488739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202826111] [2025-03-04 00:07:43,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:43,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:43,105 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:07:43,117 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:07:43,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 00:07:43,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 00:07:43,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:43,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:43,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-04 00:07:43,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 2831 proven. 648 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-04 00:07:47,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:01,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202826111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:01,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:08:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 38 [2025-03-04 00:08:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939190833] [2025-03-04 00:08:01,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:01,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 00:08:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:01,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 00:08:01,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1800, Unknown=3, NotChecked=0, Total=2162 [2025-03-04 00:08:01,338 INFO L87 Difference]: Start difference. First operand 1669 states and 2381 transitions. Second operand has 38 states, 35 states have (on average 3.942857142857143) internal successors, (138), 32 states have internal predecessors, (138), 15 states have call successors, (98), 9 states have call predecessors, (98), 12 states have return successors, (98), 15 states have call predecessors, (98), 15 states have call successors, (98)