./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-27.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 cde063dcb13ed313b2f32e49cd3dc75da2c365cf6b52ae59dd9b17042beff0a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:20:29,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:20:29,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:20:29,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:20:29,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:20:29,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:20:29,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:20:29,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:20:29,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:20:29,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:20:29,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:20:29,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:20:29,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:20:29,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:20:29,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:20:29,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:20:29,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:20:29,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:20:29,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:20:29,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:20:29,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:20:29,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:20:29,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:20:29,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:20:29,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:20:29,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:20:29,128 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 -> cde063dcb13ed313b2f32e49cd3dc75da2c365cf6b52ae59dd9b17042beff0a8 [2025-03-08 15:20:29,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:20:29,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:20:29,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:20:29,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:20:29,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:20:29,378 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-27.i [2025-03-08 15:20:30,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4c47d7a/c656a71db71f497e84ab582d59cd170e/FLAG6b4604b19 [2025-03-08 15:20:30,767 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:20:30,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-27.i [2025-03-08 15:20:30,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4c47d7a/c656a71db71f497e84ab582d59cd170e/FLAG6b4604b19 [2025-03-08 15:20:30,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4c47d7a/c656a71db71f497e84ab582d59cd170e [2025-03-08 15:20:30,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:20:30,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:20:30,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:20:30,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:20:30,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:20:30,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:20:30" (1/1) ... [2025-03-08 15:20:30,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afd394f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:30, skipping insertion in model container [2025-03-08 15:20:30,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:20:30" (1/1) ... [2025-03-08 15:20:30,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:20:30,932 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-27.i[916,929] [2025-03-08 15:20:31,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:20:31,072 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:20:31,079 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-27.i[916,929] [2025-03-08 15:20:31,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:20:31,165 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:20:31,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31 WrapperNode [2025-03-08 15:20:31,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:20:31,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:20:31,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:20:31,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:20:31,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,233 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-08 15:20:31,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:20:31,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:20:31,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:20:31,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:20:31,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,275 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-08 15:20:31,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:20:31,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:20:31,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:20:31,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:20:31,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (1/1) ... [2025-03-08 15:20:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:20:31,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:20:31,336 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-08 15:20:31,339 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-08 15:20:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:20:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:20:31,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:20:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:20:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:20:31,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:20:31,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:20:31,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:20:31,976 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L374: havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~short43#1; [2025-03-08 15:20:32,043 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-08 15:20:32,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:20:32,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:20:32,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:20:32,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:20:32 BoogieIcfgContainer [2025-03-08 15:20:32,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:20:32,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:20:32,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:20:32,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:20:32,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:20:30" (1/3) ... [2025-03-08 15:20:32,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3eb259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:20:32, skipping insertion in model container [2025-03-08 15:20:32,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:20:31" (2/3) ... [2025-03-08 15:20:32,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3eb259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:20:32, skipping insertion in model container [2025-03-08 15:20:32,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:20:32" (3/3) ... [2025-03-08 15:20:32,073 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-27.i [2025-03-08 15:20:32,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:20:32,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-27.i that has 2 procedures, 189 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:20:32,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:20:32,137 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;@74baa8a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:20:32,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:20:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 136 states have internal predecessors, (202), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:20:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-08 15:20:32,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:32,155 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:32,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:32,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash 574031725, now seen corresponding path program 1 times [2025-03-08 15:20:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:32,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076440558] [2025-03-08 15:20:32,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:32,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-08 15:20:32,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-08 15:20:32,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:32,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:20:32,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:32,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076440558] [2025-03-08 15:20:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076440558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:20:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492805022] [2025-03-08 15:20:32,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:32,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:20:32,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:20:32,581 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-08 15:20:32,582 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-08 15:20:32,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-08 15:20:32,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-08 15:20:32,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:32,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:32,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:20:32,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:20:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:20:32,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:20:32,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492805022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:32,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:20:32,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:20:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426145056] [2025-03-08 15:20:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:32,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:20:32,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:32,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:20:32,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:20:32,895 INFO L87 Difference]: Start difference. First operand has 189 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 136 states have internal predecessors, (202), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:20:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:32,938 INFO L93 Difference]: Finished difference Result 371 states and 652 transitions. [2025-03-08 15:20:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:20:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 340 [2025-03-08 15:20:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:32,947 INFO L225 Difference]: With dead ends: 371 [2025-03-08 15:20:32,949 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 15:20:32,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 341 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-08 15:20:32,957 INFO L435 NwaCegarLoop]: 289 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, 289 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-08 15:20:32,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:20:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 15:20:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-08 15:20:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 132 states have (on average 1.4621212121212122) internal successors, (193), 132 states have internal predecessors, (193), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:20:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 295 transitions. [2025-03-08 15:20:33,004 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 295 transitions. Word has length 340 [2025-03-08 15:20:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:33,005 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 295 transitions. [2025-03-08 15:20:33,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:20:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 295 transitions. [2025-03-08 15:20:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 15:20:33,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:33,016 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:33,024 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-08 15:20:33,216 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-08 15:20:33,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:33,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1962631599, now seen corresponding path program 1 times [2025-03-08 15:20:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:33,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146371844] [2025-03-08 15:20:33,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:33,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 15:20:33,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 15:20:33,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:33,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146371844] [2025-03-08 15:20:33,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146371844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:33,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:33,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:20:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251216664] [2025-03-08 15:20:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:33,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:20:33,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:33,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:20:33,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:20:33,577 INFO L87 Difference]: Start difference. First operand 185 states and 295 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:33,657 INFO L93 Difference]: Finished difference Result 461 states and 740 transitions. [2025-03-08 15:20:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:20:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-03-08 15:20:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:33,662 INFO L225 Difference]: With dead ends: 461 [2025-03-08 15:20:33,664 INFO L226 Difference]: Without dead ends: 279 [2025-03-08 15:20:33,666 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-08 15:20:33,668 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 151 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:33,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 565 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:20:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-08 15:20:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 189. [2025-03-08 15:20:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 136 states have (on average 1.463235294117647) internal successors, (199), 136 states have internal predecessors, (199), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:20:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 301 transitions. [2025-03-08 15:20:33,696 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 301 transitions. Word has length 341 [2025-03-08 15:20:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:33,699 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 301 transitions. [2025-03-08 15:20:33,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 301 transitions. [2025-03-08 15:20:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 15:20:33,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:33,705 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:33,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:20:33,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:33,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -8307858, now seen corresponding path program 1 times [2025-03-08 15:20:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:33,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476483077] [2025-03-08 15:20:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 15:20:33,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 15:20:33,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:33,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:34,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476483077] [2025-03-08 15:20:34,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476483077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:34,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:34,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:34,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362052997] [2025-03-08 15:20:34,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:34,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:34,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:34,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:34,443 INFO L87 Difference]: Start difference. First operand 189 states and 301 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:35,102 INFO L93 Difference]: Finished difference Result 733 states and 1167 transitions. [2025-03-08 15:20:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:35,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-03-08 15:20:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:35,107 INFO L225 Difference]: With dead ends: 733 [2025-03-08 15:20:35,107 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 15:20:35,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:35,108 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 519 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:35,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1384 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:20:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 15:20:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 405. [2025-03-08 15:20:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 300 states have (on average 1.4633333333333334) internal successors, (439), 300 states have internal predecessors, (439), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 15:20:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 643 transitions. [2025-03-08 15:20:35,149 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 643 transitions. Word has length 341 [2025-03-08 15:20:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:35,150 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 643 transitions. [2025-03-08 15:20:35,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 643 transitions. [2025-03-08 15:20:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 15:20:35,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:35,153 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:35,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:20:35,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:35,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1624496141, now seen corresponding path program 1 times [2025-03-08 15:20:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:35,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191335616] [2025-03-08 15:20:35,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:35,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:35,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 15:20:35,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 15:20:35,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:35,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:35,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191335616] [2025-03-08 15:20:35,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191335616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:35,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:35,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415698696] [2025-03-08 15:20:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:35,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:35,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:35,979 INFO L87 Difference]: Start difference. First operand 405 states and 643 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:36,444 INFO L93 Difference]: Finished difference Result 1315 states and 2084 transitions. [2025-03-08 15:20:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 341 [2025-03-08 15:20:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:36,452 INFO L225 Difference]: With dead ends: 1315 [2025-03-08 15:20:36,452 INFO L226 Difference]: Without dead ends: 913 [2025-03-08 15:20:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:36,454 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 414 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:36,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1057 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:20:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-08 15:20:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 750. [2025-03-08 15:20:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 583 states have (on average 1.490566037735849) internal successors, (869), 585 states have internal predecessors, (869), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-08 15:20:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1193 transitions. [2025-03-08 15:20:36,510 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1193 transitions. Word has length 341 [2025-03-08 15:20:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1193 transitions. [2025-03-08 15:20:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1193 transitions. [2025-03-08 15:20:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 15:20:36,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:36,513 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:36,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:20:36,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:36,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:36,514 INFO L85 PathProgramCache]: Analyzing trace with hash -739373936, now seen corresponding path program 1 times [2025-03-08 15:20:36,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:36,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159389306] [2025-03-08 15:20:36,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:36,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:20:36,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:20:36,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:36,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159389306] [2025-03-08 15:20:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159389306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:20:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431746713] [2025-03-08 15:20:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:37,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:20:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:37,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:20:37,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:20:37,561 INFO L87 Difference]: Start difference. First operand 750 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:37,777 INFO L93 Difference]: Finished difference Result 1456 states and 2315 transitions. [2025-03-08 15:20:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:20:37,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-03-08 15:20:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:37,782 INFO L225 Difference]: With dead ends: 1456 [2025-03-08 15:20:37,782 INFO L226 Difference]: Without dead ends: 709 [2025-03-08 15:20:37,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:20:37,785 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:37,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 779 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:20:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-08 15:20:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 684. [2025-03-08 15:20:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 517 states have (on average 1.4738878143133463) internal successors, (762), 519 states have internal predecessors, (762), 162 states have call successors, (162), 4 states have call predecessors, (162), 4 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-08 15:20:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1086 transitions. [2025-03-08 15:20:37,827 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1086 transitions. Word has length 342 [2025-03-08 15:20:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:37,828 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1086 transitions. [2025-03-08 15:20:37,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1086 transitions. [2025-03-08 15:20:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 15:20:37,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:37,830 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:37,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:20:37,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:37,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1662057519, now seen corresponding path program 1 times [2025-03-08 15:20:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754346203] [2025-03-08 15:20:37,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:37,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:20:37,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:20:37,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:37,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754346203] [2025-03-08 15:20:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754346203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:38,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:38,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381737168] [2025-03-08 15:20:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:38,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:38,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:38,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:38,398 INFO L87 Difference]: Start difference. First operand 684 states and 1086 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:38,966 INFO L93 Difference]: Finished difference Result 1790 states and 2825 transitions. [2025-03-08 15:20:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-03-08 15:20:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:38,974 INFO L225 Difference]: With dead ends: 1790 [2025-03-08 15:20:38,975 INFO L226 Difference]: Without dead ends: 1109 [2025-03-08 15:20:38,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:38,978 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 465 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:38,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 746 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:20:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-08 15:20:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 735. [2025-03-08 15:20:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 566 states have (on average 1.4505300353356891) internal successors, (821), 568 states have internal predecessors, (821), 162 states have call successors, (162), 6 states have call predecessors, (162), 6 states have return successors, (162), 160 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-08 15:20:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1145 transitions. [2025-03-08 15:20:39,054 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1145 transitions. Word has length 342 [2025-03-08 15:20:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:39,055 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1145 transitions. [2025-03-08 15:20:39,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1145 transitions. [2025-03-08 15:20:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:39,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:39,057 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:20:39,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:39,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:39,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2075439121, now seen corresponding path program 1 times [2025-03-08 15:20:39,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:39,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229466108] [2025-03-08 15:20:39,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:39,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:39,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:39,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:39,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 111 proven. 183 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-03-08 15:20:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:42,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229466108] [2025-03-08 15:20:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229466108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:20:42,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177597804] [2025-03-08 15:20:42,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:42,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:20:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:20:42,105 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-08 15:20:42,106 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-08 15:20:42,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:42,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:42,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:42,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:42,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:20:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:20:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3155 proven. 192 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2025-03-08 15:20:43,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:20:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 102 proven. 195 refuted. 0 times theorem prover too weak. 4803 trivial. 0 not checked. [2025-03-08 15:20:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177597804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:20:43,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:20:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 28 [2025-03-08 15:20:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048891577] [2025-03-08 15:20:43,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:20:43,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 15:20:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:43,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 15:20:43,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2025-03-08 15:20:43,853 INFO L87 Difference]: Start difference. First operand 735 states and 1145 transitions. Second operand has 28 states, 27 states have (on average 8.88888888888889) internal successors, (240), 28 states have internal predecessors, (240), 11 states have call successors, (143), 3 states have call predecessors, (143), 7 states have return successors, (144), 10 states have call predecessors, (144), 11 states have call successors, (144) [2025-03-08 15:20:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:45,896 INFO L93 Difference]: Finished difference Result 3239 states and 4971 transitions. [2025-03-08 15:20:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 15:20:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 8.88888888888889) internal successors, (240), 28 states have internal predecessors, (240), 11 states have call successors, (143), 3 states have call predecessors, (143), 7 states have return successors, (144), 10 states have call predecessors, (144), 11 states have call successors, (144) Word has length 343 [2025-03-08 15:20:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:45,908 INFO L225 Difference]: With dead ends: 3239 [2025-03-08 15:20:45,909 INFO L226 Difference]: Without dead ends: 2507 [2025-03-08 15:20:45,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 684 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=714, Invalid=2148, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 15:20:45,912 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 3926 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:45,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1565 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:20:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2025-03-08 15:20:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1237. [2025-03-08 15:20:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1024 states have (on average 1.451171875) internal successors, (1486), 1030 states have internal predecessors, (1486), 194 states have call successors, (194), 18 states have call predecessors, (194), 18 states have return successors, (194), 188 states have call predecessors, (194), 194 states have call successors, (194) [2025-03-08 15:20:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1874 transitions. [2025-03-08 15:20:45,997 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1874 transitions. Word has length 343 [2025-03-08 15:20:45,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:45,998 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1874 transitions. [2025-03-08 15:20:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 8.88888888888889) internal successors, (240), 28 states have internal predecessors, (240), 11 states have call successors, (143), 3 states have call predecessors, (143), 7 states have return successors, (144), 10 states have call predecessors, (144), 11 states have call successors, (144) [2025-03-08 15:20:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1874 transitions. [2025-03-08 15:20:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 15:20:46,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:46,002 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:20:46,010 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-08 15:20:46,203 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,SelfDestructingSolverStorable6 [2025-03-08 15:20:46,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2100966777, now seen corresponding path program 1 times [2025-03-08 15:20:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558791351] [2025-03-08 15:20:46,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:46,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 15:20:46,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 15:20:46,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:46,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 111 proven. 183 refuted. 0 times theorem prover too weak. 4806 trivial. 0 not checked. [2025-03-08 15:20:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558791351] [2025-03-08 15:20:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558791351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:20:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461965087] [2025-03-08 15:20:53,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:20:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:20:53,559 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-08 15:20:53,560 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-08 15:20:53,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 15:20:53,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 15:20:53,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:53,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:53,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 15:20:53,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:20:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3212 proven. 300 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2025-03-08 15:20:55,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:20:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 111 proven. 186 refuted. 0 times theorem prover too weak. 4803 trivial. 0 not checked. [2025-03-08 15:20:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461965087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:20:57,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:20:57,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2025-03-08 15:20:57,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88090942] [2025-03-08 15:20:57,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:20:57,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 15:20:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:57,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 15:20:57,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2259, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 15:20:57,367 INFO L87 Difference]: Start difference. First operand 1237 states and 1874 transitions. Second operand has 51 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 12 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 11 states have call predecessors, (153), 12 states have call successors, (153) [2025-03-08 15:21:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:34,486 INFO L93 Difference]: Finished difference Result 26737 states and 39692 transitions. [2025-03-08 15:21:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2025-03-08 15:21:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 12 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 11 states have call predecessors, (153), 12 states have call successors, (153) Word has length 345 [2025-03-08 15:21:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:34,586 INFO L225 Difference]: With dead ends: 26737 [2025-03-08 15:21:34,586 INFO L226 Difference]: Without dead ends: 25339 [2025-03-08 15:21:34,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 753 SyntacticMatches, 1 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55614 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=20528, Invalid=116002, Unknown=0, NotChecked=0, Total=136530 [2025-03-08 15:21:34,613 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 14498 mSDsluCounter, 12630 mSDsCounter, 0 mSdLazyCounter, 16600 mSolverCounterSat, 3387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14515 SdHoareTripleChecker+Valid, 13236 SdHoareTripleChecker+Invalid, 19987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3387 IncrementalHoareTripleChecker+Valid, 16600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:34,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14515 Valid, 13236 Invalid, 19987 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3387 Valid, 16600 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2025-03-08 15:21:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25339 states. [2025-03-08 15:21:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25339 to 9311. [2025-03-08 15:21:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9311 states, 7754 states have (on average 1.4502192416817126) internal successors, (11245), 7774 states have internal predecessors, (11245), 1328 states have call successors, (1328), 228 states have call predecessors, (1328), 228 states have return successors, (1328), 1308 states have call predecessors, (1328), 1328 states have call successors, (1328) [2025-03-08 15:21:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 13901 transitions. [2025-03-08 15:21:35,636 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 13901 transitions. Word has length 345 [2025-03-08 15:21:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:35,640 INFO L471 AbstractCegarLoop]: Abstraction has 9311 states and 13901 transitions. [2025-03-08 15:21:35,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 12 states have call successors, (153), 5 states have call predecessors, (153), 11 states have return successors, (153), 11 states have call predecessors, (153), 12 states have call successors, (153) [2025-03-08 15:21:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 13901 transitions. [2025-03-08 15:21:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 15:21:35,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:35,656 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:21:35,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:21:35,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:21:35,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:35,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2112282904, now seen corresponding path program 1 times [2025-03-08 15:21:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132271080] [2025-03-08 15:21:35,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:35,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 15:21:37,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 15:21:37,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 108 proven. 42 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2025-03-08 15:21:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132271080] [2025-03-08 15:21:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132271080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:21:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614431641] [2025-03-08 15:21:39,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:39,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:21:39,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:21:39,772 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-08 15:21:39,773 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-08 15:21:39,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 15:21:40,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 15:21:40,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:40,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:40,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 15:21:40,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:21:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 3426 proven. 171 refuted. 0 times theorem prover too weak. 1503 trivial. 0 not checked. [2025-03-08 15:21:41,792 INFO L312 TraceCheckSpWp]: Computing backward predicates...