./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-54.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-54.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 0cf2f240a207b9fd94ff47176fc66686eff0a1305e9376e15a89fac66684ae53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:12:47,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:12:47,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:12:47,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:12:47,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:12:47,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:12:47,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:12:47,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:12:47,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:12:47,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:12:47,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:12:47,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:12:47,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:12:47,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:12:47,774 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:12:47,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:12:47,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:12:47,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:12:47,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:47,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:12:47,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:12:47,777 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 -> 0cf2f240a207b9fd94ff47176fc66686eff0a1305e9376e15a89fac66684ae53 [2025-03-04 00:12:48,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:12:48,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:12:48,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:12:48,013 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:12:48,013 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:12:48,014 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-54.i [2025-03-04 00:12:49,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cbde2fa/957cfa3d349d4622a3982c2d391cd100/FLAG8cce3c013 [2025-03-04 00:12:49,431 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:12:49,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-54.i [2025-03-04 00:12:49,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cbde2fa/957cfa3d349d4622a3982c2d391cd100/FLAG8cce3c013 [2025-03-04 00:12:49,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73cbde2fa/957cfa3d349d4622a3982c2d391cd100 [2025-03-04 00:12:49,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:12:49,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:12:49,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:49,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:12:49,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:12:49,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:49" (1/1) ... [2025-03-04 00:12:49,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d17ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:49, skipping insertion in model container [2025-03-04 00:12:49,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:49" (1/1) ... [2025-03-04 00:12:49,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:12:49,861 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-54.i[916,929] [2025-03-04 00:12:49,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:49,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:12:49,981 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-54.i[916,929] [2025-03-04 00:12:50,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:50,053 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:12:50,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50 WrapperNode [2025-03-04 00:12:50,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:50,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:50,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:12:50,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:12:50,059 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:12:50" (1/1) ... [2025-03-04 00:12:50,071 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:12:50" (1/1) ... [2025-03-04 00:12:50,121 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 414 [2025-03-04 00:12:50,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:50,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:12:50,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:12:50,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:12:50,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,183 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:12:50,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:12:50,268 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:12:50,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:12:50,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:12:50,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (1/1) ... [2025-03-04 00:12:50,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:50,294 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:12:50,296 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:12:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:12:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:12:50,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:12:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:12:50,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:12:50,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:12:50,392 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:12:50,394 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:12:51,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: havoc property_#t~bitwise39#1;havoc property_#t~short40#1; [2025-03-04 00:12:51,108 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-04 00:12:51,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:12:51,124 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:12:51,125 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:12:51,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:51 BoogieIcfgContainer [2025-03-04 00:12:51,126 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:12:51,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:12:51,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:12:51,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:12:51,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:12:49" (1/3) ... [2025-03-04 00:12:51,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564a4e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:51, skipping insertion in model container [2025-03-04 00:12:51,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:50" (2/3) ... [2025-03-04 00:12:51,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564a4e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:51, skipping insertion in model container [2025-03-04 00:12:51,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:51" (3/3) ... [2025-03-04 00:12:51,135 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-54.i [2025-03-04 00:12:51,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:12:51,147 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-54.i that has 2 procedures, 181 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:12:51,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:12:51,192 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;@4c7ed9d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:12:51,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:12:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 113 states have internal predecessors, (167), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 00:12:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-04 00:12:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:51,212 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:51,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:51,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash 542799718, now seen corresponding path program 1 times [2025-03-04 00:12:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279050938] [2025-03-04 00:12:51,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:51,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 00:12:51,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 00:12:51,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:51,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-04 00:12:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279050938] [2025-03-04 00:12:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279050938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783333455] [2025-03-04 00:12:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:51,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:51,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:51,673 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:12:51,675 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:12:51,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 00:12:51,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 00:12:51,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:51,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:12:51,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-04 00:12:51,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:12:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783333455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:51,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:12:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:12:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574588867] [2025-03-04 00:12:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:51,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:12:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:51,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:12:51,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:12:51,996 INFO L87 Difference]: Start difference. First operand has 181 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 113 states have internal predecessors, (167), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-04 00:12:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:52,031 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2025-03-04 00:12:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:12:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 403 [2025-03-04 00:12:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:52,038 INFO L225 Difference]: With dead ends: 356 [2025-03-04 00:12:52,039 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 00:12:52,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 404 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:12:52,045 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:52,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:12:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 00:12:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-04 00:12:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 00:12:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 293 transitions. [2025-03-04 00:12:52,105 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 293 transitions. Word has length 403 [2025-03-04 00:12:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:52,106 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 293 transitions. [2025-03-04 00:12:52,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-04 00:12:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 293 transitions. [2025-03-04 00:12:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-04 00:12:52,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:52,116 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:52,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:12:52,316 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:12:52,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -317707393, now seen corresponding path program 1 times [2025-03-04 00:12:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117224922] [2025-03-04 00:12:52,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:52,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 00:12:52,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 00:12:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-04 00:12:52,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117224922] [2025-03-04 00:12:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117224922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:52,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:52,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789176964] [2025-03-04 00:12:52,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:52,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:52,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:52,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:52,681 INFO L87 Difference]: Start difference. First operand 178 states and 293 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-04 00:12:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:52,787 INFO L93 Difference]: Finished difference Result 436 states and 718 transitions. [2025-03-04 00:12:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:52,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 403 [2025-03-04 00:12:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:52,790 INFO L225 Difference]: With dead ends: 436 [2025-03-04 00:12:52,791 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 00:12:52,792 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:12:52,793 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 135 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:52,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 553 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 00:12:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2025-03-04 00:12:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 175 states have (on average 1.497142857142857) internal successors, (262), 176 states have internal predecessors, (262), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 00:12:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 422 transitions. [2025-03-04 00:12:52,846 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 422 transitions. Word has length 403 [2025-03-04 00:12:52,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:52,847 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 422 transitions. [2025-03-04 00:12:52,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-04 00:12:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 422 transitions. [2025-03-04 00:12:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-04 00:12:52,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:52,853 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:12:52,854 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1266694314, now seen corresponding path program 1 times [2025-03-04 00:12:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227482573] [2025-03-04 00:12:52,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:52,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-04 00:12:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-04 00:12:53,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:53,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 6 proven. 189 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 00:12:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227482573] [2025-03-04 00:12:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227482573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932307387] [2025-03-04 00:12:54,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:54,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:54,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:54,369 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:12:54,370 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:12:54,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-04 00:12:54,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-04 00:12:54,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:54,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:54,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:12:54,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 573 proven. 189 refuted. 0 times theorem prover too weak. 7818 trivial. 0 not checked. [2025-03-04 00:12:55,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 6 proven. 189 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 00:12:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932307387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:55,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:12:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064760420] [2025-03-04 00:12:55,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:12:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:55,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:12:55,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:55,696 INFO L87 Difference]: Start difference. First operand 258 states and 422 transitions. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 3 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (193), 3 states have call predecessors, (193), 3 states have call successors, (193) [2025-03-04 00:12:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:56,081 INFO L93 Difference]: Finished difference Result 525 states and 851 transitions. [2025-03-04 00:12:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:12:56,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 3 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (193), 3 states have call predecessors, (193), 3 states have call successors, (193) Word has length 404 [2025-03-04 00:12:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:56,085 INFO L225 Difference]: With dead ends: 525 [2025-03-04 00:12:56,085 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 00:12:56,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:12:56,086 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 223 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:56,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 465 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 00:12:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2025-03-04 00:12:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 181 states have (on average 1.4364640883977902) internal successors, (260), 182 states have internal predecessors, (260), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-04 00:12:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 420 transitions. [2025-03-04 00:12:56,116 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 420 transitions. Word has length 404 [2025-03-04 00:12:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 420 transitions. [2025-03-04 00:12:56,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 3 states have call successors, (192), 2 states have call predecessors, (192), 4 states have return successors, (193), 3 states have call predecessors, (193), 3 states have call successors, (193) [2025-03-04 00:12:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 420 transitions. [2025-03-04 00:12:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:12:56,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:56,120 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:12:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 00:12:56,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1981694313, now seen corresponding path program 1 times [2025-03-04 00:12:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:56,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068201087] [2025-03-04 00:12:56,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:56,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:12:56,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:12:56,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:56,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 423 proven. 144 refuted. 0 times theorem prover too weak. 8013 trivial. 0 not checked. [2025-03-04 00:12:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068201087] [2025-03-04 00:12:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068201087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978501316] [2025-03-04 00:12:58,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:58,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:58,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:58,544 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:12:58,546 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:12:58,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:12:58,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:12:58,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:58,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:58,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:12:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 2006 proven. 342 refuted. 0 times theorem prover too weak. 6232 trivial. 0 not checked. [2025-03-04 00:12:59,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 42 proven. 345 refuted. 0 times theorem prover too weak. 8193 trivial. 0 not checked. [2025-03-04 00:13:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978501316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:01,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:01,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 24 [2025-03-04 00:13:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409330234] [2025-03-04 00:13:01,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:01,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 00:13:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:01,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 00:13:01,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:13:01,164 INFO L87 Difference]: Start difference. First operand 266 states and 420 transitions. Second operand has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 24 states have internal predecessors, (196), 8 states have call successors, (184), 3 states have call predecessors, (184), 7 states have return successors, (186), 8 states have call predecessors, (186), 8 states have call successors, (186) [2025-03-04 00:13:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:05,798 INFO L93 Difference]: Finished difference Result 1269 states and 1903 transitions. [2025-03-04 00:13:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-04 00:13:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 24 states have internal predecessors, (196), 8 states have call successors, (184), 3 states have call predecessors, (184), 7 states have return successors, (186), 8 states have call predecessors, (186), 8 states have call successors, (186) Word has length 405 [2025-03-04 00:13:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:05,808 INFO L225 Difference]: With dead ends: 1269 [2025-03-04 00:13:05,810 INFO L226 Difference]: Without dead ends: 1006 [2025-03-04 00:13:05,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2206 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1689, Invalid=5967, Unknown=0, NotChecked=0, Total=7656 [2025-03-04 00:13:05,814 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1532 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 3728 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 4177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 3728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:05,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 2673 Invalid, 4177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 3728 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 00:13:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-04 00:13:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 793. [2025-03-04 00:13:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 592 states have (on average 1.429054054054054) internal successors, (846), 598 states have internal predecessors, (846), 172 states have call successors, (172), 28 states have call predecessors, (172), 28 states have return successors, (172), 166 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-04 00:13:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1190 transitions. [2025-03-04 00:13:05,910 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1190 transitions. Word has length 405 [2025-03-04 00:13:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:05,912 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1190 transitions. [2025-03-04 00:13:05,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.166666666666666) internal successors, (196), 24 states have internal predecessors, (196), 8 states have call successors, (184), 3 states have call predecessors, (184), 7 states have return successors, (186), 8 states have call predecessors, (186), 8 states have call successors, (186) [2025-03-04 00:13:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1190 transitions. [2025-03-04 00:13:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:13:05,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:05,918 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:05,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:06,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:06,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:06,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1488022379, now seen corresponding path program 1 times [2025-03-04 00:13:06,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:06,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881499364] [2025-03-04 00:13:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:06,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:13:06,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:13:06,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:06,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 177 proven. 18 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 00:13:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881499364] [2025-03-04 00:13:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881499364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749655239] [2025-03-04 00:13:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:06,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:06,988 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:13:06,990 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:13:07,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:13:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:13:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:07,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 00:13:07,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 1607 proven. 30 refuted. 0 times theorem prover too weak. 6943 trivial. 0 not checked. [2025-03-04 00:13:07,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 177 proven. 18 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-04 00:13:07,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749655239] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:07,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:07,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-04 00:13:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933645127] [2025-03-04 00:13:07,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:07,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:13:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:07,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:13:07,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:13:07,688 INFO L87 Difference]: Start difference. First operand 793 states and 1190 transitions. Second operand has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 14 states have internal predecessors, (120), 4 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (79), 4 states have call predecessors, (79), 4 states have call successors, (79) [2025-03-04 00:13:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:09,138 INFO L93 Difference]: Finished difference Result 2127 states and 3144 transitions. [2025-03-04 00:13:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 00:13:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 14 states have internal predecessors, (120), 4 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (79), 4 states have call predecessors, (79), 4 states have call successors, (79) Word has length 405 [2025-03-04 00:13:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:09,146 INFO L225 Difference]: With dead ends: 2127 [2025-03-04 00:13:09,146 INFO L226 Difference]: Without dead ends: 1337 [2025-03-04 00:13:09,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 807 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=424, Invalid=1058, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 00:13:09,149 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 1058 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:09,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1550 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:13:09,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2025-03-04 00:13:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1263. [2025-03-04 00:13:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 873 states have (on average 1.3573883161512028) internal successors, (1185), 883 states have internal predecessors, (1185), 332 states have call successors, (332), 57 states have call predecessors, (332), 57 states have return successors, (332), 322 states have call predecessors, (332), 332 states have call successors, (332) [2025-03-04 00:13:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1849 transitions. [2025-03-04 00:13:09,255 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1849 transitions. Word has length 405 [2025-03-04 00:13:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:09,256 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1849 transitions. [2025-03-04 00:13:09,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.571428571428571) internal successors, (120), 14 states have internal predecessors, (120), 4 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (79), 4 states have call predecessors, (79), 4 states have call successors, (79) [2025-03-04 00:13:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1849 transitions. [2025-03-04 00:13:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:13:09,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:09,263 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:09,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:09,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:09,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -171281525, now seen corresponding path program 1 times [2025-03-04 00:13:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620921371] [2025-03-04 00:13:09,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:09,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:13:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:13:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 165 proven. 219 refuted. 0 times theorem prover too weak. 8196 trivial. 0 not checked. [2025-03-04 00:13:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620921371] [2025-03-04 00:13:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620921371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513374870] [2025-03-04 00:13:11,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:11,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:11,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:11,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:13:11,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:13:11,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:13:11,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:11,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:11,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 00:13:11,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 5458 proven. 645 refuted. 0 times theorem prover too weak. 2477 trivial. 0 not checked. [2025-03-04 00:13:13,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 417 proven. 345 refuted. 0 times theorem prover too weak. 7818 trivial. 0 not checked. [2025-03-04 00:13:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513374870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:16,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:16,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 17] total 42 [2025-03-04 00:13:16,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330951458] [2025-03-04 00:13:16,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:16,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 00:13:16,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:16,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 00:13:16,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 00:13:16,741 INFO L87 Difference]: Start difference. First operand 1263 states and 1849 transitions. Second operand has 42 states, 41 states have (on average 5.146341463414634) internal successors, (211), 40 states have internal predecessors, (211), 14 states have call successors, (164), 7 states have call predecessors, (164), 16 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166) [2025-03-04 00:13:21,474 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 [] [2025-03-04 00:13:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:31,228 INFO L93 Difference]: Finished difference Result 2786 states and 3974 transitions. [2025-03-04 00:13:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 00:13:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 5.146341463414634) internal successors, (211), 40 states have internal predecessors, (211), 14 states have call successors, (164), 7 states have call predecessors, (164), 16 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166) Word has length 405 [2025-03-04 00:13:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:31,239 INFO L225 Difference]: With dead ends: 2786 [2025-03-04 00:13:31,239 INFO L226 Difference]: Without dead ends: 1541 [2025-03-04 00:13:31,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 783 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2528 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1848, Invalid=6524, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 00:13:31,245 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1194 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 759 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 3505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:31,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2420 Invalid, 3505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 2745 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2025-03-04 00:13:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-03-04 00:13:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 633. [2025-03-04 00:13:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 483 states have internal predecessors, (666), 120 states have call successors, (120), 33 states have call predecessors, (120), 33 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-04 00:13:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 906 transitions. [2025-03-04 00:13:31,356 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 906 transitions. Word has length 405 [2025-03-04 00:13:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 906 transitions. [2025-03-04 00:13:31,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 5.146341463414634) internal successors, (211), 40 states have internal predecessors, (211), 14 states have call successors, (164), 7 states have call predecessors, (164), 16 states have return successors, (166), 14 states have call predecessors, (166), 14 states have call successors, (166) [2025-03-04 00:13:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 906 transitions. [2025-03-04 00:13:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 00:13:31,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:31,362 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:31,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:13:31,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:31,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 217174377, now seen corresponding path program 1 times [2025-03-04 00:13:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95004738] [2025-03-04 00:13:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:31,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:32,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:32,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:32,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 336 proven. 231 refuted. 0 times theorem prover too weak. 8013 trivial. 0 not checked. [2025-03-04 00:13:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95004738] [2025-03-04 00:13:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95004738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806420979] [2025-03-04 00:13:33,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:33,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:33,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:13:33,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:33,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:33,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:33,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 00:13:33,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 5589 proven. 924 refuted. 0 times theorem prover too weak. 2067 trivial. 0 not checked. [2025-03-04 00:13:38,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806420979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:39,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:13:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 29] total 36 [2025-03-04 00:13:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169500040] [2025-03-04 00:13:39,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:39,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 00:13:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:39,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 00:13:39,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 00:13:39,753 INFO L87 Difference]: Start difference. First operand 633 states and 906 transitions. Second operand has 36 states, 36 states have (on average 4.75) internal successors, (171), 34 states have internal predecessors, (171), 12 states have call successors, (128), 9 states have call predecessors, (128), 15 states have return successors, (129), 12 states have call predecessors, (129), 12 states have call successors, (129) [2025-03-04 00:13:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:44,547 INFO L93 Difference]: Finished difference Result 1634 states and 2330 transitions. [2025-03-04 00:13:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 00:13:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.75) internal successors, (171), 34 states have internal predecessors, (171), 12 states have call successors, (128), 9 states have call predecessors, (128), 15 states have return successors, (129), 12 states have call predecessors, (129), 12 states have call successors, (129) Word has length 406 [2025-03-04 00:13:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:44,561 INFO L225 Difference]: With dead ends: 1634 [2025-03-04 00:13:44,561 INFO L226 Difference]: Without dead ends: 1071 [2025-03-04 00:13:44,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2354 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1628, Invalid=6204, Unknown=0, NotChecked=0, Total=7832 [2025-03-04 00:13:44,566 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 748 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:44,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1808 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 2799 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 00:13:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-04 00:13:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 655. [2025-03-04 00:13:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 501 states have (on average 1.3932135728542914) internal successors, (698), 505 states have internal predecessors, (698), 120 states have call successors, (120), 33 states have call predecessors, (120), 33 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-04 00:13:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 938 transitions. [2025-03-04 00:13:44,732 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 938 transitions. Word has length 406 [2025-03-04 00:13:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:44,734 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 938 transitions. [2025-03-04 00:13:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.75) internal successors, (171), 34 states have internal predecessors, (171), 12 states have call successors, (128), 9 states have call predecessors, (128), 15 states have return successors, (129), 12 states have call predecessors, (129), 12 states have call successors, (129) [2025-03-04 00:13:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 938 transitions. [2025-03-04 00:13:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 00:13:44,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:44,737 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:44,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:44,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:44,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 428525290, now seen corresponding path program 1 times [2025-03-04 00:13:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393992934] [2025-03-04 00:13:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:44,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:45,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:45,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:45,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:45,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547063477] [2025-03-04 00:13:45,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:45,565 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:45,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:13:45,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:46,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:46,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:46,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 00:13:46,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4333 proven. 405 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-03-04 00:13:48,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:52,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_22~0 4294967296)) (.cse2 (mod c_~last_1_var_1_61~0 4294967296)) (.cse1 (mod c_~var_1_26~0 256))) (and (or (< (div .cse0 .cse1) (+ (* 4294967296 (div .cse0 .cse1 4294967296)) .cse2)) (< .cse0 1)) (forall ((v_z_157 Int) (v_y_156 Int)) (let ((.cse4 (div v_z_157 .cse1)) (.cse3 (* v_y_156 4294967296))) (or (< 255 v_z_157) (< v_z_157 .cse0) (< (+ .cse3 4294967295) .cse4) (< .cse4 (+ .cse3 .cse2))))))) is different from false [2025-03-04 00:13:53,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393992934] [2025-03-04 00:13:53,499 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:13:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547063477] [2025-03-04 00:13:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547063477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:53,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 00:13:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177451533] [2025-03-04 00:13:53,500 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:13:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:53,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:13:53,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=158, Unknown=1, NotChecked=26, Total=240 [2025-03-04 00:13:53,502 INFO L87 Difference]: Start difference. First operand 655 states and 938 transitions. Second operand has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (66), 4 states have call predecessors, (66), 6 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-04 00:14:02,779 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:14:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:14:03,948 INFO L93 Difference]: Finished difference Result 1481 states and 2125 transitions. [2025-03-04 00:14:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 00:14:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (66), 4 states have call predecessors, (66), 6 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 406 [2025-03-04 00:14:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:14:03,953 INFO L225 Difference]: With dead ends: 1481 [2025-03-04 00:14:03,953 INFO L226 Difference]: Without dead ends: 896 [2025-03-04 00:14:03,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=237, Invalid=636, Unknown=1, NotChecked=56, Total=930 [2025-03-04 00:14:03,955 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 309 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 230 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:14:03,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1563 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 761 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2025-03-04 00:14:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-04 00:14:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 773. [2025-03-04 00:14:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 568 states have (on average 1.357394366197183) internal successors, (771), 571 states have internal predecessors, (771), 160 states have call successors, (160), 44 states have call predecessors, (160), 44 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-04 00:14:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1091 transitions. [2025-03-04 00:14:04,088 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1091 transitions. Word has length 406 [2025-03-04 00:14:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:14:04,089 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1091 transitions. [2025-03-04 00:14:04,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 12 states have internal predecessors, (94), 4 states have call successors, (66), 4 states have call predecessors, (66), 6 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2025-03-04 00:14:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1091 transitions. [2025-03-04 00:14:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-04 00:14:04,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:14:04,092 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:14:04,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:14:04,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:04,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:14:04,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:14:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 312331888, now seen corresponding path program 1 times [2025-03-04 00:14:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:14:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681818849] [2025-03-04 00:14:04,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:14:04,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:14:04,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:14:04,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:04,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:14:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407656368] [2025-03-04 00:14:04,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:04,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:04,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:04,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:14:04,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:14:05,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:14:05,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:14:05,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:05,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:14:05,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 00:14:05,443 INFO L279 TraceCheckSpWp]: Computing forward predicates...