./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-43.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-43.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 795f4667c1e1102b044359aec08de90b52cc6317a469c691f5b4c1088e37925d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:11:42,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:11:42,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:11:42,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:11:42,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:11:42,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:11:42,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:11:42,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:11:42,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:11:42,151 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:11:42,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:11:42,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:11:42,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:11:42,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:11:42,152 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:11:42,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:11:42,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:11:42,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:11:42,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:11:42,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:11:42,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:11:42,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:11:42,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:11:42,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:42,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:11:42,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:11:42,155 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 -> 795f4667c1e1102b044359aec08de90b52cc6317a469c691f5b4c1088e37925d [2025-03-04 00:11:42,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:11:42,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:11:42,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:11:42,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:11:42,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:11:42,415 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-43.i [2025-03-04 00:11:43,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428af488a/5f271105e64c4ddebee1c29edd89dbb5/FLAG1e31bf11a [2025-03-04 00:11:43,911 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:11:43,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-43.i [2025-03-04 00:11:43,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428af488a/5f271105e64c4ddebee1c29edd89dbb5/FLAG1e31bf11a [2025-03-04 00:11:44,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428af488a/5f271105e64c4ddebee1c29edd89dbb5 [2025-03-04 00:11:44,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:11:44,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:11:44,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:44,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:11:44,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:11:44,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186b46e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44, skipping insertion in model container [2025-03-04 00:11:44,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:11:44,325 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-43.i[916,929] [2025-03-04 00:11:44,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:44,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:11:44,491 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-43.i[916,929] [2025-03-04 00:11:44,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:44,578 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:11:44,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44 WrapperNode [2025-03-04 00:11:44,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:44,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:44,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:11:44,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:11:44,584 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:11:44" (1/1) ... [2025-03-04 00:11:44,600 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:11:44" (1/1) ... [2025-03-04 00:11:44,653 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 526 [2025-03-04 00:11:44,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:44,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:11:44,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:11:44,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:11:44,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,710 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:11:44,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:11:44,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:11:44,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:11:44,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:11:44,764 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (1/1) ... [2025-03-04 00:11:44,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:44,790 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:11:44,793 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:11:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:11:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:11:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:11:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:11:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:11:44,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:11:44,901 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:11:44,903 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:11:45,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~ite53#1;havoc property_#t~bitwise49#1;havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1; [2025-03-04 00:11:45,648 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-04 00:11:45,649 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:11:45,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:11:45,675 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:11:45,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:45 BoogieIcfgContainer [2025-03-04 00:11:45,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:11:45,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:11:45,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:11:45,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:11:45,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:11:44" (1/3) ... [2025-03-04 00:11:45,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a64c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:45, skipping insertion in model container [2025-03-04 00:11:45,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:44" (2/3) ... [2025-03-04 00:11:45,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a64c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:45, skipping insertion in model container [2025-03-04 00:11:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:45" (3/3) ... [2025-03-04 00:11:45,704 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-43.i [2025-03-04 00:11:45,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:11:45,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-43.i that has 2 procedures, 223 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:11:45,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:11:45,775 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;@44f6daf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:11:45,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:11:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 157 states have (on average 1.4713375796178343) internal successors, (231), 158 states have internal predecessors, (231), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 00:11:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-04 00:11:45,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:45,798 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:45,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1803332361, now seen corresponding path program 1 times [2025-03-04 00:11:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:45,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512663638] [2025-03-04 00:11:45,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:45,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:45,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-04 00:11:45,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-04 00:11:45,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:45,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-04 00:11:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512663638] [2025-03-04 00:11:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512663638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675193692] [2025-03-04 00:11:46,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:46,266 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:11:46,268 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:11:46,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-04 00:11:46,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-04 00:11:46,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:46,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:46,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:11:46,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-04 00:11:46,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675193692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:11:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347816874] [2025-03-04 00:11:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:46,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:11:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:46,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:11:46,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:11:46,593 INFO L87 Difference]: Start difference. First operand has 223 states, 157 states have (on average 1.4713375796178343) internal successors, (231), 158 states have internal predecessors, (231), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-04 00:11:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:46,653 INFO L93 Difference]: Finished difference Result 440 states and 772 transitions. [2025-03-04 00:11:46,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:11:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) Word has length 411 [2025-03-04 00:11:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:46,660 INFO L225 Difference]: With dead ends: 440 [2025-03-04 00:11:46,660 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 00:11:46,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 412 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:11:46,668 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:46,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 00:11:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-04 00:11:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 155 states have (on average 1.4516129032258065) internal successors, (225), 155 states have internal predecessors, (225), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-04 00:11:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 351 transitions. [2025-03-04 00:11:46,729 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 351 transitions. Word has length 411 [2025-03-04 00:11:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:46,729 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 351 transitions. [2025-03-04 00:11:46,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-04 00:11:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 351 transitions. [2025-03-04 00:11:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-04 00:11:46,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:46,737 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:46,745 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:11:46,938 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:11:46,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:46,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash -611136868, now seen corresponding path program 1 times [2025-03-04 00:11:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976491554] [2025-03-04 00:11:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:46,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-04 00:11:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-04 00:11:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:11:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:47,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976491554] [2025-03-04 00:11:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976491554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:47,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274758111] [2025-03-04 00:11:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:47,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:47,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:47,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:47,499 INFO L87 Difference]: Start difference. First operand 220 states and 351 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:47,888 INFO L93 Difference]: Finished difference Result 764 states and 1214 transitions. [2025-03-04 00:11:47,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:11:47,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 411 [2025-03-04 00:11:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:47,894 INFO L225 Difference]: With dead ends: 764 [2025-03-04 00:11:47,894 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:11:47,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:47,896 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 436 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:47,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1118 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:11:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:11:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 523. [2025-03-04 00:11:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 394 states have (on average 1.484771573604061) internal successors, (585), 394 states have internal predecessors, (585), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-04 00:11:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 837 transitions. [2025-03-04 00:11:47,977 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 837 transitions. Word has length 411 [2025-03-04 00:11:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 837 transitions. [2025-03-04 00:11:47,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 837 transitions. [2025-03-04 00:11:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-04 00:11:47,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:47,984 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:47,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:11:47,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:47,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1529309784, now seen corresponding path program 1 times [2025-03-04 00:11:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842414224] [2025-03-04 00:11:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:48,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-04 00:11:48,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-04 00:11:48,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:48,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:11:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842414224] [2025-03-04 00:11:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842414224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393816525] [2025-03-04 00:11:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:48,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:48,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:48,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:48,336 INFO L87 Difference]: Start difference. First operand 523 states and 837 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:48,651 INFO L93 Difference]: Finished difference Result 1415 states and 2263 transitions. [2025-03-04 00:11:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 412 [2025-03-04 00:11:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:48,660 INFO L225 Difference]: With dead ends: 1415 [2025-03-04 00:11:48,660 INFO L226 Difference]: Without dead ends: 895 [2025-03-04 00:11:48,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:48,663 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 273 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:48,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 985 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:11:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-04 00:11:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 879. [2025-03-04 00:11:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 686 states have (on average 1.5029154518950438) internal successors, (1031), 686 states have internal predecessors, (1031), 189 states have call successors, (189), 3 states have call predecessors, (189), 3 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-03-04 00:11:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1409 transitions. [2025-03-04 00:11:48,755 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1409 transitions. Word has length 412 [2025-03-04 00:11:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:48,758 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1409 transitions. [2025-03-04 00:11:48,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1409 transitions. [2025-03-04 00:11:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-04 00:11:48,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:48,762 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:48,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:11:48,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:48,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1578244161, now seen corresponding path program 1 times [2025-03-04 00:11:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433630583] [2025-03-04 00:11:48,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:48,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 00:11:49,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 00:11:49,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:49,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:11:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433630583] [2025-03-04 00:11:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433630583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:49,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:49,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:11:49,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283662916] [2025-03-04 00:11:49,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:11:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:49,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:11:49,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:11:49,509 INFO L87 Difference]: Start difference. First operand 879 states and 1409 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:49,878 INFO L93 Difference]: Finished difference Result 2820 states and 4521 transitions. [2025-03-04 00:11:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:11:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 413 [2025-03-04 00:11:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:49,893 INFO L225 Difference]: With dead ends: 2820 [2025-03-04 00:11:49,894 INFO L226 Difference]: Without dead ends: 2051 [2025-03-04 00:11:49,897 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:11:49,897 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 575 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:49,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 999 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:11:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-04 00:11:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1643. [2025-03-04 00:11:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1322 states have (on average 1.5158850226928895) internal successors, (2004), 1322 states have internal predecessors, (2004), 315 states have call successors, (315), 5 states have call predecessors, (315), 5 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-04 00:11:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2634 transitions. [2025-03-04 00:11:50,041 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2634 transitions. Word has length 413 [2025-03-04 00:11:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:50,041 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2634 transitions. [2025-03-04 00:11:50,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2634 transitions. [2025-03-04 00:11:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-04 00:11:50,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:50,046 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:50,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:11:50,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1557906786, now seen corresponding path program 1 times [2025-03-04 00:11:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997394698] [2025-03-04 00:11:50,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:50,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 00:11:50,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 00:11:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:50,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 213 proven. 153 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-03-04 00:11:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997394698] [2025-03-04 00:11:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997394698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664740664] [2025-03-04 00:11:51,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:51,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:51,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:51,718 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:11:51,720 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:11:51,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 00:11:51,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 00:11:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:51,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:11:51,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5013 proven. 168 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2025-03-04 00:11:52,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 198 proven. 171 refuted. 0 times theorem prover too weak. 7443 trivial. 0 not checked. [2025-03-04 00:11:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664740664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:11:53,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:11:53,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-03-04 00:11:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641567841] [2025-03-04 00:11:53,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:11:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:53,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:11:53,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:11:53,347 INFO L87 Difference]: Start difference. First operand 1643 states and 2634 transitions. Second operand has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 7 states have call successors, (139), 3 states have call predecessors, (139), 7 states have return successors, (141), 7 states have call predecessors, (141), 7 states have call successors, (141) [2025-03-04 00:11:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:54,303 INFO L93 Difference]: Finished difference Result 3279 states and 5165 transitions. [2025-03-04 00:11:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:11:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 7 states have call successors, (139), 3 states have call predecessors, (139), 7 states have return successors, (141), 7 states have call predecessors, (141), 7 states have call successors, (141) Word has length 413 [2025-03-04 00:11:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:54,312 INFO L225 Difference]: With dead ends: 3279 [2025-03-04 00:11:54,312 INFO L226 Difference]: Without dead ends: 1763 [2025-03-04 00:11:54,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 823 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=819, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 00:11:54,317 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 591 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:54,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 785 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:11:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-03-04 00:11:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1723. [2025-03-04 00:11:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1382 states have (on average 1.4848046309696092) internal successors, (2052), 1382 states have internal predecessors, (2052), 315 states have call successors, (315), 25 states have call predecessors, (315), 25 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-04 00:11:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2682 transitions. [2025-03-04 00:11:54,430 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2682 transitions. Word has length 413 [2025-03-04 00:11:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2682 transitions. [2025-03-04 00:11:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 7 states have call successors, (139), 3 states have call predecessors, (139), 7 states have return successors, (141), 7 states have call predecessors, (141), 7 states have call successors, (141) [2025-03-04 00:11:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2682 transitions. [2025-03-04 00:11:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-04 00:11:54,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:54,437 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:54,445 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:11:54,641 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:11:54,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:54,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash -509650912, now seen corresponding path program 1 times [2025-03-04 00:11:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126376878] [2025-03-04 00:11:54,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:54,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 00:11:54,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 00:11:54,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:54,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-04 00:11:54,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:54,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126376878] [2025-03-04 00:11:54,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126376878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:54,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:54,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532453939] [2025-03-04 00:11:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:54,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:54,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:54,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:54,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:54,860 INFO L87 Difference]: Start difference. First operand 1723 states and 2682 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:55,004 INFO L93 Difference]: Finished difference Result 3275 states and 5105 transitions. [2025-03-04 00:11:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:55,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 413 [2025-03-04 00:11:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:55,016 INFO L225 Difference]: With dead ends: 3275 [2025-03-04 00:11:55,017 INFO L226 Difference]: Without dead ends: 1723 [2025-03-04 00:11:55,021 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:11:55,023 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:55,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 323 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-03-04 00:11:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2025-03-04 00:11:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1382 states have (on average 1.4529667149059333) internal successors, (2008), 1382 states have internal predecessors, (2008), 315 states have call successors, (315), 25 states have call predecessors, (315), 25 states have return successors, (315), 315 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-04 00:11:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2638 transitions. [2025-03-04 00:11:55,159 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2638 transitions. Word has length 413 [2025-03-04 00:11:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:55,160 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2638 transitions. [2025-03-04 00:11:55,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-04 00:11:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2638 transitions. [2025-03-04 00:11:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-04 00:11:55,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:55,165 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:55,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:11:55,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2115393718, now seen corresponding path program 1 times [2025-03-04 00:11:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465398291] [2025-03-04 00:11:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:55,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 00:11:55,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 00:11:55,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:55,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 264 proven. 102 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-03-04 00:11:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465398291] [2025-03-04 00:11:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465398291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6992352] [2025-03-04 00:11:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:57,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:57,483 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:11:57,485 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:11:57,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 00:11:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 00:11:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:57,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:11:57,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4580 proven. 186 refuted. 0 times theorem prover too weak. 3046 trivial. 0 not checked. [2025-03-04 00:12:03,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6992352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:07,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:12:07,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16] total 19 [2025-03-04 00:12:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893038378] [2025-03-04 00:12:07,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:07,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:12:07,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:07,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:12:07,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=372, Unknown=1, NotChecked=0, Total=462 [2025-03-04 00:12:07,332 INFO L87 Difference]: Start difference. First operand 1723 states and 2638 transitions. Second operand has 19 states, 19 states have (on average 9.157894736842104) internal successors, (174), 18 states have internal predecessors, (174), 6 states have call successors, (92), 5 states have call predecessors, (92), 7 states have return successors, (92), 6 states have call predecessors, (92), 6 states have call successors, (92) [2025-03-04 00:12:18,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:23,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:27,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:31,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:36,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:37,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:42,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:46,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:49,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:12:54,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:13:04,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:13:10,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:13:14,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]