./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-0.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-0.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 bc8ba5687f86ca6bc535ef8887bd15483610a3c920778b0e5f157ae799e621ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:12,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:13,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:13,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:13,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:13,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:13,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:13,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:13,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:13,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:13,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:13,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:13,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:13,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:13,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:13,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:13,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:13,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:13,115 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 -> bc8ba5687f86ca6bc535ef8887bd15483610a3c920778b0e5f157ae799e621ff [2025-03-04 00:07:13,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:13,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:13,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:13,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:13,488 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:13,489 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-0.i [2025-03-04 00:07:14,905 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5916194/7f526ddc8f6d4ee69b45fcb460046a51/FLAG637ebc72d [2025-03-04 00:07:15,215 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:15,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-0.i [2025-03-04 00:07:15,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5916194/7f526ddc8f6d4ee69b45fcb460046a51/FLAG637ebc72d [2025-03-04 00:07:15,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5916194/7f526ddc8f6d4ee69b45fcb460046a51 [2025-03-04 00:07:15,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:15,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:15,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:15,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:15,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:15,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:15,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3993ea07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15, skipping insertion in model container [2025-03-04 00:07:15,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:15,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:15,688 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-0.i[915,928] [2025-03-04 00:07:15,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:15,848 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:15,856 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-0.i[915,928] [2025-03-04 00:07:15,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:15,950 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:15,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15 WrapperNode [2025-03-04 00:07:15,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:15,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:15,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:15,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:15,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:15,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,047 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 344 [2025-03-04 00:07:16,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:16,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:16,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:16,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:16,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,115 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:07:16,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:16,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:16,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:16,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:16,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (1/1) ... [2025-03-04 00:07:16,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:16,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:16,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:07:16,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:07:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:16,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:16,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:16,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:16,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:16,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:16,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:16,974 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc property_#t~bitwise26#1;havoc property_#t~bitwise27#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-04 00:07:17,052 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:17,052 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:17,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:17,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:17,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:17 BoogieIcfgContainer [2025-03-04 00:07:17,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:17,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:17,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:17,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:17,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:15" (1/3) ... [2025-03-04 00:07:17,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77620d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:17, skipping insertion in model container [2025-03-04 00:07:17,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:15" (2/3) ... [2025-03-04 00:07:17,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77620d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:17, skipping insertion in model container [2025-03-04 00:07:17,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:17" (3/3) ... [2025-03-04 00:07:17,083 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-0.i [2025-03-04 00:07:17,101 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:17,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-0.i that has 2 procedures, 147 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:17,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:17,239 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;@66189738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:17,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 113 states have internal predecessors, (172), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:07:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-04 00:07:17,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:17,266 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:17,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:17,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 854875364, now seen corresponding path program 1 times [2025-03-04 00:07:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:17,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532353767] [2025-03-04 00:07:17,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:17,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 00:07:17,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 00:07:17,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:17,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-04 00:07:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:17,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532353767] [2025-03-04 00:07:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532353767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398402625] [2025-03-04 00:07:17,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:17,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:17,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:17,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:07:17,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 00:07:17,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 00:07:17,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:17,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:17,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:17,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-04 00:07:17,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398402625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:17,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:07:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309462912] [2025-03-04 00:07:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:18,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:18,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:18,005 INFO L87 Difference]: Start difference. First operand has 147 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 113 states have internal predecessors, (172), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 00:07:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:18,046 INFO L93 Difference]: Finished difference Result 288 states and 499 transitions. [2025-03-04 00:07:18,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:18,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 230 [2025-03-04 00:07:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:18,054 INFO L225 Difference]: With dead ends: 288 [2025-03-04 00:07:18,055 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 00:07:18,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 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:07:18,059 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:18,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 00:07:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 00:07:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.518181818181818) internal successors, (167), 110 states have internal predecessors, (167), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:07:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 231 transitions. [2025-03-04 00:07:18,101 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 231 transitions. Word has length 230 [2025-03-04 00:07:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:18,101 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 231 transitions. [2025-03-04 00:07:18,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 00:07:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 231 transitions. [2025-03-04 00:07:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-04 00:07:18,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:18,106 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:18,113 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:07:18,307 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:07:18,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:18,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1883854582, now seen corresponding path program 1 times [2025-03-04 00:07:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:18,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714547612] [2025-03-04 00:07:18,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:18,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 00:07:18,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 00:07:18,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:18,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-04 00:07:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:18,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714547612] [2025-03-04 00:07:18,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714547612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:18,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:18,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:07:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100744685] [2025-03-04 00:07:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:18,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:07:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:18,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:07:18,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:07:18,690 INFO L87 Difference]: Start difference. First operand 144 states and 231 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 00:07:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:18,832 INFO L93 Difference]: Finished difference Result 382 states and 612 transitions. [2025-03-04 00:07:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:07:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 230 [2025-03-04 00:07:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:18,836 INFO L225 Difference]: With dead ends: 382 [2025-03-04 00:07:18,836 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 00:07:18,839 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:07:18,840 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 149 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:18,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 418 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 00:07:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2025-03-04 00:07:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 193 states have (on average 1.5336787564766838) internal successors, (296), 194 states have internal predecessors, (296), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:07:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 380 transitions. [2025-03-04 00:07:18,880 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 380 transitions. Word has length 230 [2025-03-04 00:07:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:18,881 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 380 transitions. [2025-03-04 00:07:18,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 00:07:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 380 transitions. [2025-03-04 00:07:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-04 00:07:18,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:18,886 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:18,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:18,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:18,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash 66445673, now seen corresponding path program 1 times [2025-03-04 00:07:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99687967] [2025-03-04 00:07:18,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:18,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 00:07:19,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 00:07:19,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:19,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:07:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99687967] [2025-03-04 00:07:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99687967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:19,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004259011] [2025-03-04 00:07:19,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:19,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:19,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:07:19,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 00:07:19,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 00:07:19,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:19,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:19,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:07:19,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 993 proven. 54 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-03-04 00:07:20,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:07:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004259011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:20,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:07:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098092112] [2025-03-04 00:07:20,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:20,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:07:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:20,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:07:20,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:07:20,720 INFO L87 Difference]: Start difference. First operand 238 states and 380 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 3 states have call successors, (73), 2 states have call predecessors, (73), 4 states have return successors, (75), 3 states have call predecessors, (75), 3 states have call successors, (75) [2025-03-04 00:07:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:21,078 INFO L93 Difference]: Finished difference Result 489 states and 770 transitions. [2025-03-04 00:07:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:07:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 3 states have call successors, (73), 2 states have call predecessors, (73), 4 states have return successors, (75), 3 states have call predecessors, (75), 3 states have call successors, (75) Word has length 230 [2025-03-04 00:07:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:21,082 INFO L225 Difference]: With dead ends: 489 [2025-03-04 00:07:21,082 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 00:07:21,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 457 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:07:21,084 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 434 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:21,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 428 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:07:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 00:07:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2025-03-04 00:07:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 202 states have (on average 1.4554455445544554) internal successors, (294), 203 states have internal predecessors, (294), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:07:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2025-03-04 00:07:21,110 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 230 [2025-03-04 00:07:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:21,111 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2025-03-04 00:07:21,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 3 states have call successors, (73), 2 states have call predecessors, (73), 4 states have return successors, (75), 3 states have call predecessors, (75), 3 states have call successors, (75) [2025-03-04 00:07:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2025-03-04 00:07:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-04 00:07:21,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:21,114 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:21,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:21,316 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:07:21,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:21,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1967379464, now seen corresponding path program 1 times [2025-03-04 00:07:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8189351] [2025-03-04 00:07:21,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:21,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 00:07:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 00:07:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:21,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:07:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8189351] [2025-03-04 00:07:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8189351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814854364] [2025-03-04 00:07:21,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:21,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:21,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:07:21,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-04 00:07:22,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-04 00:07:22,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:22,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:07:22,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 891 proven. 63 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-04 00:07:22,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:07:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814854364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:22,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:07:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871905811] [2025-03-04 00:07:22,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:07:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:22,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:07:22,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:07:22,508 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:07:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:22,797 INFO L93 Difference]: Finished difference Result 435 states and 649 transitions. [2025-03-04 00:07:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:07:22,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 231 [2025-03-04 00:07:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:22,802 INFO L225 Difference]: With dead ends: 435 [2025-03-04 00:07:22,802 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 00:07:22,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 459 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:07:22,806 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 144 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:22,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 523 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:07:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 00:07:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2025-03-04 00:07:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 135 states have internal predecessors, (182), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 00:07:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 266 transitions. [2025-03-04 00:07:22,826 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 266 transitions. Word has length 231 [2025-03-04 00:07:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:22,827 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 266 transitions. [2025-03-04 00:07:22,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:07:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 266 transitions. [2025-03-04 00:07:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:07:22,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:22,829 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:22,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:07:23,029 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:07:23,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:23,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 286132139, now seen corresponding path program 1 times [2025-03-04 00:07:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581229153] [2025-03-04 00:07:23,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:23,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:23,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:23,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:23,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:07:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581229153] [2025-03-04 00:07:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581229153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804547694] [2025-03-04 00:07:24,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:24,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:24,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:07:24,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:07:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:24,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:24,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:24,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:07:24,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 423 proven. 9 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2025-03-04 00:07:25,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:07:25,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804547694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:07:25,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:07:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2025-03-04 00:07:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446553802] [2025-03-04 00:07:25,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:25,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:07:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:25,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:07:25,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:07:25,582 INFO L87 Difference]: Start difference. First operand 183 states and 266 transitions. Second operand has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-04 00:07:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:33,907 INFO L93 Difference]: Finished difference Result 2769 states and 3912 transitions. [2025-03-04 00:07:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-04 00:07:33,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 232 [2025-03-04 00:07:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:33,925 INFO L225 Difference]: With dead ends: 2769 [2025-03-04 00:07:33,925 INFO L226 Difference]: Without dead ends: 2616 [2025-03-04 00:07:33,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7396 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3357, Invalid=16383, Unknown=0, NotChecked=0, Total=19740 [2025-03-04 00:07:33,935 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 5139 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 3668 mSolverCounterSat, 3389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5170 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 7057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3389 IncrementalHoareTripleChecker+Valid, 3668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:33,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5170 Valid, 2305 Invalid, 7057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3389 Valid, 3668 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 00:07:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2025-03-04 00:07:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 718. [2025-03-04 00:07:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 561 states have (on average 1.411764705882353) internal successors, (792), 564 states have internal predecessors, (792), 134 states have call successors, (134), 22 states have call predecessors, (134), 22 states have return successors, (134), 131 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-04 00:07:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1060 transitions. [2025-03-04 00:07:34,087 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1060 transitions. Word has length 232 [2025-03-04 00:07:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:34,088 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1060 transitions. [2025-03-04 00:07:34,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 19 states have internal predecessors, (146), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-04 00:07:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1060 transitions. [2025-03-04 00:07:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:07:34,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:34,090 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:34,097 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:07:34,290 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:07:34,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:34,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -224402038, now seen corresponding path program 1 times [2025-03-04 00:07:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:34,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79201092] [2025-03-04 00:07:34,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:34,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:34,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:34,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-04 00:07:34,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79201092] [2025-03-04 00:07:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79201092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:34,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:07:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172849907] [2025-03-04 00:07:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:34,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:07:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:34,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:07:34,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:07:34,836 INFO L87 Difference]: Start difference. First operand 718 states and 1060 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 00:07:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:35,119 INFO L93 Difference]: Finished difference Result 2384 states and 3564 transitions. [2025-03-04 00:07:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:07:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 232 [2025-03-04 00:07:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:35,130 INFO L225 Difference]: With dead ends: 2384 [2025-03-04 00:07:35,130 INFO L226 Difference]: Without dead ends: 1692 [2025-03-04 00:07:35,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:07:35,133 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 470 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:35,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 612 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2025-03-04 00:07:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1394. [2025-03-04 00:07:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1093 states have (on average 1.4117108874656907) internal successors, (1543), 1098 states have internal predecessors, (1543), 258 states have call successors, (258), 42 states have call predecessors, (258), 42 states have return successors, (258), 253 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 00:07:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2059 transitions. [2025-03-04 00:07:35,274 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2059 transitions. Word has length 232 [2025-03-04 00:07:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:35,275 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2059 transitions. [2025-03-04 00:07:35,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 00:07:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2059 transitions. [2025-03-04 00:07:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:07:35,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:35,278 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:07:35,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 618373482, now seen corresponding path program 1 times [2025-03-04 00:07:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:35,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535457271] [2025-03-04 00:07:35,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:35,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:35,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:35,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:35,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:07:35,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733028797] [2025-03-04 00:07:35,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:35,573 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:07:35,575 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:07:35,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:35,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:35,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:35,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:35,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 00:07:35,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1255 proven. 63 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-04 00:07:36,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535457271] [2025-03-04 00:07:37,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:07:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733028797] [2025-03-04 00:07:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733028797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:37,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-04 00:07:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661250751] [2025-03-04 00:07:37,750 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:37,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:07:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:37,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:07:37,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:07:37,751 INFO L87 Difference]: Start difference. First operand 1394 states and 2059 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 4 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-04 00:07:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:41,418 INFO L93 Difference]: Finished difference Result 5602 states and 7977 transitions. [2025-03-04 00:07:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 00:07:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 4 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 232 [2025-03-04 00:07:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:41,456 INFO L225 Difference]: With dead ends: 5602 [2025-03-04 00:07:41,457 INFO L226 Difference]: Without dead ends: 4238 [2025-03-04 00:07:41,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=733, Invalid=1919, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 00:07:41,471 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1275 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:41,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1122 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 00:07:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2025-03-04 00:07:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 2223. [2025-03-04 00:07:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1910 states have (on average 1.4329842931937173) internal successors, (2737), 1917 states have internal predecessors, (2737), 252 states have call successors, (252), 60 states have call predecessors, (252), 60 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-04 00:07:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3241 transitions. [2025-03-04 00:07:41,798 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3241 transitions. Word has length 232 [2025-03-04 00:07:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:41,803 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 3241 transitions. [2025-03-04 00:07:41,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 4 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-04 00:07:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3241 transitions. [2025-03-04 00:07:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:07:41,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:41,808 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:07:41,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:42,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:42,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:42,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash -893404981, now seen corresponding path program 1 times [2025-03-04 00:07:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733835662] [2025-03-04 00:07:42,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:42,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:42,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:42,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:42,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:42,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:07:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060590037] [2025-03-04 00:07:42,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:42,235 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:07:42,244 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:07:42,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:07:42,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:07:42,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:42,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:42,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:07:42,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1173 proven. 48 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-03-04 00:07:43,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733835662] [2025-03-04 00:07:46,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:07:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060590037] [2025-03-04 00:07:46,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060590037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:46,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-03-04 00:07:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099429236] [2025-03-04 00:07:46,241 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:07:46,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:07:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:46,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:07:46,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:07:46,243 INFO L87 Difference]: Start difference. First operand 2223 states and 3241 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-04 00:07:50,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:07:55,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:07:57,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:08:02,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:08:07,404 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:08:09,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:08:14,759 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:08:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:23,070 INFO L93 Difference]: Finished difference Result 15429 states and 22067 transitions. [2025-03-04 00:08:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-04 00:08:23,071 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 232 [2025-03-04 00:08:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:23,145 INFO L225 Difference]: With dead ends: 15429 [2025-03-04 00:08:23,146 INFO L226 Difference]: Without dead ends: 13247 [2025-03-04 00:08:23,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5941 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2992, Invalid=14562, Unknown=2, NotChecked=0, Total=17556 [2025-03-04 00:08:23,164 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1548 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 639 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 5006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:23,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 3919 Invalid, 5006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 4360 Invalid, 7 Unknown, 0 Unchecked, 28.6s Time] [2025-03-04 00:08:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13247 states. [2025-03-04 00:08:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13247 to 6944. [2025-03-04 00:08:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6143 states have (on average 1.4471756470779749) internal successors, (8890), 6160 states have internal predecessors, (8890), 620 states have call successors, (620), 180 states have call predecessors, (620), 180 states have return successors, (620), 603 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-04 00:08:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 10130 transitions. [2025-03-04 00:08:24,757 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 10130 transitions. Word has length 232 [2025-03-04 00:08:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 6944 states and 10130 transitions. [2025-03-04 00:08:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-04 00:08:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 10130 transitions. [2025-03-04 00:08:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:08:24,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:24,773 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:24,794 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:08:24,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:24,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1324352972, now seen corresponding path program 1 times [2025-03-04 00:08:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848289984] [2025-03-04 00:08:24,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:08:25,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:08:25,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-04 00:08:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848289984] [2025-03-04 00:08:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848289984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:08:25,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:08:25,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:08:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589680430] [2025-03-04 00:08:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:08:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:08:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:08:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:08:25,354 INFO L87 Difference]: Start difference. First operand 6944 states and 10130 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 00:08:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:26,041 INFO L93 Difference]: Finished difference Result 13725 states and 20023 transitions. [2025-03-04 00:08:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:08:26,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 232 [2025-03-04 00:08:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:26,096 INFO L225 Difference]: With dead ends: 13725 [2025-03-04 00:08:26,096 INFO L226 Difference]: Without dead ends: 6822 [2025-03-04 00:08:26,106 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:08:26,106 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:26,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:08:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2025-03-04 00:08:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 6822. [2025-03-04 00:08:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6822 states, 6021 states have (on average 1.4382992858329182) internal successors, (8660), 6038 states have internal predecessors, (8660), 620 states have call successors, (620), 180 states have call predecessors, (620), 180 states have return successors, (620), 603 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-04 00:08:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6822 states to 6822 states and 9900 transitions. [2025-03-04 00:08:27,123 INFO L78 Accepts]: Start accepts. Automaton has 6822 states and 9900 transitions. Word has length 232 [2025-03-04 00:08:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:27,124 INFO L471 AbstractCegarLoop]: Abstraction has 6822 states and 9900 transitions. [2025-03-04 00:08:27,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 00:08:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6822 states and 9900 transitions. [2025-03-04 00:08:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:08:27,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:27,131 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:27,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:08:27,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:27,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1391458474, now seen corresponding path program 1 times [2025-03-04 00:08:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989638872] [2025-03-04 00:08:27,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:27,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:08:27,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:08:27,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:27,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 69 proven. 24 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:08:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989638872] [2025-03-04 00:08:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989638872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326530890] [2025-03-04 00:08:27,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:27,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:27,470 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:08:27,474 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:08:27,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:08:27,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:08:27,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:27,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:27,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:08:27,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 813 proven. 24 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2025-03-04 00:08:27,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 69 proven. 24 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-04 00:08:27,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326530890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:08:27,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:08:27,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:08:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872073104] [2025-03-04 00:08:27,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:27,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:08:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:27,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:08:27,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:08:27,896 INFO L87 Difference]: Start difference. First operand 6822 states and 9900 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-04 00:08:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:28,589 INFO L93 Difference]: Finished difference Result 11056 states and 15972 transitions. [2025-03-04 00:08:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:08:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 232 [2025-03-04 00:08:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:28,603 INFO L225 Difference]: With dead ends: 11056 [2025-03-04 00:08:28,604 INFO L226 Difference]: Without dead ends: 4275 [2025-03-04 00:08:28,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:08:28,614 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 276 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:28,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 443 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:08:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-04 00:08:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 2036. [2025-03-04 00:08:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1847 states have (on average 1.4629128316188413) internal successors, (2702), 1848 states have internal predecessors, (2702), 140 states have call successors, (140), 48 states have call predecessors, (140), 48 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 00:08:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2982 transitions. [2025-03-04 00:08:28,880 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2982 transitions. Word has length 232 [2025-03-04 00:08:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:28,880 INFO L471 AbstractCegarLoop]: Abstraction has 2036 states and 2982 transitions. [2025-03-04 00:08:28,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-04 00:08:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2982 transitions. [2025-03-04 00:08:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 00:08:28,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:28,885 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,894 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:08:29,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:29,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:29,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash -406320439, now seen corresponding path program 1 times [2025-03-04 00:08:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024923617] [2025-03-04 00:08:29,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:29,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:08:29,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:08:29,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:29,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:08:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311522001] [2025-03-04 00:08:29,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:29,269 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:08:29,271 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:08:29,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-04 00:08:29,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-04 00:08:29,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:29,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:29,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:08:29,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-04 00:08:29,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:08:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:08:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024923617] [2025-03-04 00:08:30,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:08:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311522001] [2025-03-04 00:08:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311522001] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:08:30,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:08:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 00:08:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517409186] [2025-03-04 00:08:30,141 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:08:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:08:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:08:30,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:08:30,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:08:30,142 INFO L87 Difference]: Start difference. First operand 2036 states and 2982 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 00:08:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:08:30,728 INFO L93 Difference]: Finished difference Result 5208 states and 7570 transitions. [2025-03-04 00:08:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:08:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 232 [2025-03-04 00:08:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:08:30,736 INFO L225 Difference]: With dead ends: 5208 [2025-03-04 00:08:30,736 INFO L226 Difference]: Without dead ends: 3213 [2025-03-04 00:08:30,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:08:30,740 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 194 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:08:30,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 633 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:08:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2025-03-04 00:08:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3169. [2025-03-04 00:08:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3169 states, 2808 states have (on average 1.4344729344729346) internal successors, (4028), 2809 states have internal predecessors, (4028), 268 states have call successors, (268), 92 states have call predecessors, (268), 92 states have return successors, (268), 267 states have call predecessors, (268), 268 states have call successors, (268) [2025-03-04 00:08:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 4564 transitions. [2025-03-04 00:08:31,111 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 4564 transitions. Word has length 232 [2025-03-04 00:08:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:08:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 3169 states and 4564 transitions. [2025-03-04 00:08:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 00:08:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 4564 transitions. [2025-03-04 00:08:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 00:08:31,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:08:31,115 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:31,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 00:08:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 00:08:31,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:08:31,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:08:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -679853478, now seen corresponding path program 1 times [2025-03-04 00:08:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:08:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824909410] [2025-03-04 00:08:31,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:08:31,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 00:08:31,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 00:08:31,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:31,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:08:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528382916] [2025-03-04 00:08:31,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:08:31,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:08:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:08:31,456 INFO L229 MonitoredProcess]: Starting monitored process 10 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:08:31,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 00:08:31,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 00:08:31,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 00:08:31,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:08:31,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:08:31,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 00:08:31,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:08:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1173 proven. 48 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-03-04 00:08:32,232 INFO L312 TraceCheckSpWp]: Computing backward predicates...