./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.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_fillercode_fillercodesize_ps-cn-500_file-32.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 4d8190b73b1c4bb4c40d32cc6dbe0fce4e7bf91cb328b437eab368a12fac4d3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:18:18,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:18:19,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:18:19,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:18:19,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:18:19,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:18:19,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:18:19,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:18:19,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:18:19,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:18:19,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:18:19,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:18:19,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:18:19,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:18:19,089 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:18:19,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:18:19,090 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:18:19,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:18:19,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:18:19,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:18:19,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:18:19,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:18:19,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:18:19,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:18:19,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:18:19,091 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 -> 4d8190b73b1c4bb4c40d32cc6dbe0fce4e7bf91cb328b437eab368a12fac4d3f [2025-03-08 11:18:19,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:18:19,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:18:19,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:18:19,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:18:19,315 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:18:19,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i [2025-03-08 11:18:20,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8245fbfd5/3339c2ad9055452789fff51887d7c0df/FLAG6a7c475b6 [2025-03-08 11:18:20,727 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:18:20,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-32.i [2025-03-08 11:18:20,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8245fbfd5/3339c2ad9055452789fff51887d7c0df/FLAG6a7c475b6 [2025-03-08 11:18:20,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8245fbfd5/3339c2ad9055452789fff51887d7c0df [2025-03-08 11:18:20,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:18:20,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:18:20,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:18:20,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:18:20,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:18:20,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:18:20" (1/1) ... [2025-03-08 11:18:20,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:20, skipping insertion in model container [2025-03-08 11:18:20,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:18:20" (1/1) ... [2025-03-08 11:18:20,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:18:20,906 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_fillercode_fillercodesize_ps-cn-500_file-32.i[916,929] [2025-03-08 11:18:21,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:18:21,080 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:18:21,090 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_fillercode_fillercodesize_ps-cn-500_file-32.i[916,929] [2025-03-08 11:18:21,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:18:21,205 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:18:21,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21 WrapperNode [2025-03-08 11:18:21,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:18:21,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:18:21,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:18:21,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:18:21,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,298 INFO L138 Inliner]: procedures = 26, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 890 [2025-03-08 11:18:21,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:18:21,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:18:21,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:18:21,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:18:21,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,352 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 11:18:21,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:18:21,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:18:21,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:18:21,410 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:18:21,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (1/1) ... [2025-03-08 11:18:21,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:18:21,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:21,437 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 11:18:21,440 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 11:18:21,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:18:21,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:18:21,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:18:21,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:18:21,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:18:22,601 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 11:18:22,602 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:18:22,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:18:22,634 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 11:18:22,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:18:22 BoogieIcfgContainer [2025-03-08 11:18:22,634 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:18:22,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:18:22,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:18:22,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:18:22,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:18:20" (1/3) ... [2025-03-08 11:18:22,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c56428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:18:22, skipping insertion in model container [2025-03-08 11:18:22,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:21" (2/3) ... [2025-03-08 11:18:22,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c56428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:18:22, skipping insertion in model container [2025-03-08 11:18:22,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:18:22" (3/3) ... [2025-03-08 11:18:22,644 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-32.i [2025-03-08 11:18:22,655 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:18:22,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-32.i that has 2 procedures, 372 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:18:22,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:18:22,727 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;@37fe1026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:18:22,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:18:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 248 states have internal predecessors, (389), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 11:18:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:22,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:22,760 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:22,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:22,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2049536111, now seen corresponding path program 1 times [2025-03-08 11:18:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:22,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616186447] [2025-03-08 11:18:22,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:22,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:22,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:22,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:22,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-03-08 11:18:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616186447] [2025-03-08 11:18:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616186447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:18:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325430433] [2025-03-08 11:18:23,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:23,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:18:23,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:23,389 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 11:18:23,390 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 11:18:23,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:23,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:23,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:23,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:23,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:18:23,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:18:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 29282 trivial. 0 not checked. [2025-03-08 11:18:23,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:18:23,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325430433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:23,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:18:23,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:18:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719247863] [2025-03-08 11:18:23,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:23,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:18:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:23,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:18:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:18:23,871 INFO L87 Difference]: Start difference. First operand has 372 states, 247 states have (on average 1.5748987854251013) internal successors, (389), 248 states have internal predecessors, (389), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:18:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:23,966 INFO L93 Difference]: Finished difference Result 738 states and 1383 transitions. [2025-03-08 11:18:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:18:23,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) Word has length 765 [2025-03-08 11:18:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:23,979 INFO L225 Difference]: With dead ends: 738 [2025-03-08 11:18:23,979 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 11:18:23,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 766 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 11:18:23,987 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:23,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 11:18:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-08 11:18:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 245 states have internal predecessors, (382), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 11:18:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 626 transitions. [2025-03-08 11:18:24,072 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 626 transitions. Word has length 765 [2025-03-08 11:18:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:24,074 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 626 transitions. [2025-03-08 11:18:24,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:18:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 626 transitions. [2025-03-08 11:18:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:24,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:24,089 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:24,098 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 11:18:24,290 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 11:18:24,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:24,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1148951346, now seen corresponding path program 1 times [2025-03-08 11:18:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:24,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564293199] [2025-03-08 11:18:24,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:24,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:24,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:24,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564293199] [2025-03-08 11:18:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564293199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184850341] [2025-03-08 11:18:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:25,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:25,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:25,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:25,313 INFO L87 Difference]: Start difference. First operand 369 states and 626 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:25,389 INFO L93 Difference]: Finished difference Result 736 states and 1251 transitions. [2025-03-08 11:18:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-03-08 11:18:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:25,394 INFO L225 Difference]: With dead ends: 736 [2025-03-08 11:18:25,394 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 11:18:25,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 11:18:25,396 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 0 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:25,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1215 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 11:18:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-08 11:18:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 246 states have (on average 1.556910569105691) internal successors, (383), 246 states have internal predecessors, (383), 122 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 11:18:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 627 transitions. [2025-03-08 11:18:25,434 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 627 transitions. Word has length 765 [2025-03-08 11:18:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:25,439 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 627 transitions. [2025-03-08 11:18:25,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 627 transitions. [2025-03-08 11:18:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:25,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:25,456 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:25,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:18:25,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 855548339, now seen corresponding path program 1 times [2025-03-08 11:18:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048164675] [2025-03-08 11:18:25,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:25,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:25,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:25,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:25,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:25,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048164675] [2025-03-08 11:18:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048164675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:25,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:18:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151825501] [2025-03-08 11:18:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:18:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:25,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:18:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:18:25,857 INFO L87 Difference]: Start difference. First operand 370 states and 627 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:26,087 INFO L93 Difference]: Finished difference Result 934 states and 1598 transitions. [2025-03-08 11:18:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:18:26,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-03-08 11:18:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:26,096 INFO L225 Difference]: With dead ends: 934 [2025-03-08 11:18:26,096 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 11:18:26,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:18:26,101 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 342 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:26,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 2336 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:18:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 11:18:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 564. [2025-03-08 11:18:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 420 states have (on average 1.6404761904761904) internal successors, (689), 421 states have internal predecessors, (689), 141 states have call successors, (141), 2 states have call predecessors, (141), 2 states have return successors, (141), 140 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-08 11:18:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 971 transitions. [2025-03-08 11:18:26,175 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 971 transitions. Word has length 765 [2025-03-08 11:18:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:26,176 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 971 transitions. [2025-03-08 11:18:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 971 transitions. [2025-03-08 11:18:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:26,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:26,190 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:26,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:18:26,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:26,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1728831355, now seen corresponding path program 1 times [2025-03-08 11:18:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:26,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999025685] [2025-03-08 11:18:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:26,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:26,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:26,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:26,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999025685] [2025-03-08 11:18:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999025685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:27,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:18:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006785284] [2025-03-08 11:18:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:27,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:18:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:27,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:18:27,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:18:27,920 INFO L87 Difference]: Start difference. First operand 564 states and 971 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:18:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:31,099 INFO L93 Difference]: Finished difference Result 4030 states and 6927 transitions. [2025-03-08 11:18:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 11:18:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) Word has length 765 [2025-03-08 11:18:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:31,119 INFO L225 Difference]: With dead ends: 4030 [2025-03-08 11:18:31,119 INFO L226 Difference]: Without dead ends: 3469 [2025-03-08 11:18:31,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2025-03-08 11:18:31,123 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 4511 mSDsluCounter, 3427 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 808 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 808 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:31,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 4332 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [808 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 11:18:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2025-03-08 11:18:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 2187. [2025-03-08 11:18:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 1711 states have (on average 1.6744593804792518) internal successors, (2865), 1720 states have internal predecessors, (2865), 461 states have call successors, (461), 14 states have call predecessors, (461), 14 states have return successors, (461), 452 states have call predecessors, (461), 461 states have call successors, (461) [2025-03-08 11:18:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3787 transitions. [2025-03-08 11:18:31,337 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3787 transitions. Word has length 765 [2025-03-08 11:18:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:31,339 INFO L471 AbstractCegarLoop]: Abstraction has 2187 states and 3787 transitions. [2025-03-08 11:18:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:18:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3787 transitions. [2025-03-08 11:18:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:31,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:31,348 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:18:31,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:31,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1432945348, now seen corresponding path program 1 times [2025-03-08 11:18:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:31,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739185187] [2025-03-08 11:18:31,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:31,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:31,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:31,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:31,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739185187] [2025-03-08 11:18:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739185187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:18:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169624352] [2025-03-08 11:18:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:32,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:18:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:32,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:18:32,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:18:32,999 INFO L87 Difference]: Start difference. First operand 2187 states and 3787 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:18:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:38,200 INFO L93 Difference]: Finished difference Result 19447 states and 33443 transitions. [2025-03-08 11:18:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 11:18:38,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) Word has length 765 [2025-03-08 11:18:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:38,308 INFO L225 Difference]: With dead ends: 19447 [2025-03-08 11:18:38,309 INFO L226 Difference]: Without dead ends: 17306 [2025-03-08 11:18:38,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 11:18:38,320 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 5416 mSDsluCounter, 4366 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 1614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5416 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1614 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:38,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5416 Valid, 5078 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1614 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 11:18:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17306 states. [2025-03-08 11:18:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17306 to 11435. [2025-03-08 11:18:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 9209 states have (on average 1.6841133673580193) internal successors, (15509), 9272 states have internal predecessors, (15509), 2118 states have call successors, (2118), 107 states have call predecessors, (2118), 107 states have return successors, (2118), 2055 states have call predecessors, (2118), 2118 states have call successors, (2118) [2025-03-08 11:18:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 19745 transitions. [2025-03-08 11:18:39,282 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 19745 transitions. Word has length 765 [2025-03-08 11:18:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 11435 states and 19745 transitions. [2025-03-08 11:18:39,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:18:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 19745 transitions. [2025-03-08 11:18:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:39,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:39,305 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:18:39,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:39,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1400441949, now seen corresponding path program 1 times [2025-03-08 11:18:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977907943] [2025-03-08 11:18:39,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:39,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:39,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:39,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:39,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:39,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:39,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977907943] [2025-03-08 11:18:39,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977907943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:39,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:39,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57846460] [2025-03-08 11:18:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:39,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:39,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:39,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:39,793 INFO L87 Difference]: Start difference. First operand 11435 states and 19745 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:40,684 INFO L93 Difference]: Finished difference Result 30728 states and 53222 transitions. [2025-03-08 11:18:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-03-08 11:18:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:40,772 INFO L225 Difference]: With dead ends: 30728 [2025-03-08 11:18:40,773 INFO L226 Difference]: Without dead ends: 19394 [2025-03-08 11:18:40,803 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 11:18:40,804 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 373 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19394 states. [2025-03-08 11:18:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19394 to 19301. [2025-03-08 11:18:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19301 states, 15786 states have (on average 1.6949195489674396) internal successors, (26756), 15883 states have internal predecessors, (26756), 3344 states have call successors, (3344), 170 states have call predecessors, (3344), 170 states have return successors, (3344), 3247 states have call predecessors, (3344), 3344 states have call successors, (3344) [2025-03-08 11:18:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 33444 transitions. [2025-03-08 11:18:42,296 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 33444 transitions. Word has length 765 [2025-03-08 11:18:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:42,298 INFO L471 AbstractCegarLoop]: Abstraction has 19301 states and 33444 transitions. [2025-03-08 11:18:42,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 33444 transitions. [2025-03-08 11:18:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:42,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:42,321 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:42,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:18:42,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1369422142, now seen corresponding path program 1 times [2025-03-08 11:18:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932561513] [2025-03-08 11:18:42,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:42,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:42,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:42,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:42,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932561513] [2025-03-08 11:18:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932561513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:43,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:43,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089169454] [2025-03-08 11:18:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:43,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:43,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:43,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:43,060 INFO L87 Difference]: Start difference. First operand 19301 states and 33444 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:43,975 INFO L93 Difference]: Finished difference Result 38588 states and 66928 transitions. [2025-03-08 11:18:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:43,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 765 [2025-03-08 11:18:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:44,041 INFO L225 Difference]: With dead ends: 38588 [2025-03-08 11:18:44,041 INFO L226 Difference]: Without dead ends: 19417 [2025-03-08 11:18:44,077 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 11:18:44,078 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 0 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:44,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1215 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19417 states. [2025-03-08 11:18:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19417 to 19417. [2025-03-08 11:18:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19417 states, 15902 states have (on average 1.6898503332914099) internal successors, (26872), 15999 states have internal predecessors, (26872), 3344 states have call successors, (3344), 170 states have call predecessors, (3344), 170 states have return successors, (3344), 3247 states have call predecessors, (3344), 3344 states have call successors, (3344) [2025-03-08 11:18:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19417 states to 19417 states and 33560 transitions. [2025-03-08 11:18:45,152 INFO L78 Accepts]: Start accepts. Automaton has 19417 states and 33560 transitions. Word has length 765 [2025-03-08 11:18:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:45,153 INFO L471 AbstractCegarLoop]: Abstraction has 19417 states and 33560 transitions. [2025-03-08 11:18:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:18:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19417 states and 33560 transitions. [2025-03-08 11:18:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-03-08 11:18:45,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:45,170 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:45,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:18:45,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1818118781, now seen corresponding path program 1 times [2025-03-08 11:18:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149625329] [2025-03-08 11:18:45,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:45,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:45,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:45,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:45,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 42 proven. 321 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-03-08 11:18:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149625329] [2025-03-08 11:18:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149625329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:18:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416845151] [2025-03-08 11:18:45,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:18:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:45,831 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 11:18:45,832 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 11:18:45,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-03-08 11:18:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-03-08 11:18:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:46,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:46,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:18:46,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:18:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 12991 proven. 246 refuted. 0 times theorem prover too weak. 16287 trivial. 0 not checked. [2025-03-08 11:18:47,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:18:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 117 proven. 246 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-03-08 11:18:48,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416845151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:18:48,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:18:48,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 13 [2025-03-08 11:18:48,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101031113] [2025-03-08 11:18:48,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:18:48,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 11:18:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:48,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 11:18:48,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:18:48,511 INFO L87 Difference]: Start difference. First operand 19417 states and 33560 transitions. Second operand has 13 states, 13 states have (on average 35.46153846153846) internal successors, (461), 13 states have internal predecessors, (461), 6 states have call successors, (366), 3 states have call predecessors, (366), 6 states have return successors, (366), 6 states have call predecessors, (366), 6 states have call successors, (366) [2025-03-08 11:18:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:54,005 INFO L93 Difference]: Finished difference Result 72763 states and 126147 transitions. [2025-03-08 11:18:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 11:18:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 35.46153846153846) internal successors, (461), 13 states have internal predecessors, (461), 6 states have call successors, (366), 3 states have call predecessors, (366), 6 states have return successors, (366), 6 states have call predecessors, (366), 6 states have call successors, (366) Word has length 765 [2025-03-08 11:18:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:54,160 INFO L225 Difference]: With dead ends: 72763 [2025-03-08 11:18:54,160 INFO L226 Difference]: Without dead ends: 53476 [2025-03-08 11:18:54,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1573 GetRequests, 1531 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 11:18:54,200 INFO L435 NwaCegarLoop]: 1075 mSDtfsCounter, 3267 mSDsluCounter, 5396 mSDsCounter, 0 mSdLazyCounter, 4743 mSolverCounterSat, 1475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 6471 SdHoareTripleChecker+Invalid, 6218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1475 IncrementalHoareTripleChecker+Valid, 4743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:54,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 6471 Invalid, 6218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1475 Valid, 4743 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 11:18:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53476 states. [2025-03-08 11:18:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53476 to 29791. [2025-03-08 11:18:56,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29791 states, 24403 states have (on average 1.675654632627136) internal successors, (40891), 24548 states have internal predecessors, (40891), 4987 states have call successors, (4987), 400 states have call predecessors, (4987), 400 states have return successors, (4987), 4842 states have call predecessors, (4987), 4987 states have call successors, (4987) [2025-03-08 11:18:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29791 states to 29791 states and 50865 transitions. [2025-03-08 11:18:56,639 INFO L78 Accepts]: Start accepts. Automaton has 29791 states and 50865 transitions. Word has length 765 [2025-03-08 11:18:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:56,640 INFO L471 AbstractCegarLoop]: Abstraction has 29791 states and 50865 transitions. [2025-03-08 11:18:56,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.46153846153846) internal successors, (461), 13 states have internal predecessors, (461), 6 states have call successors, (366), 3 states have call predecessors, (366), 6 states have return successors, (366), 6 states have call predecessors, (366), 6 states have call successors, (366) [2025-03-08 11:18:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 29791 states and 50865 transitions. [2025-03-08 11:18:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2025-03-08 11:18:56,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:56,659 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:18:56,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:18:56,859 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,SelfDestructingSolverStorable7 [2025-03-08 11:18:56,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 792506776, now seen corresponding path program 1 times [2025-03-08 11:18:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412805847] [2025-03-08 11:18:56,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:56,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-03-08 11:18:56,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-03-08 11:18:56,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:56,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:18:57,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:57,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412805847] [2025-03-08 11:18:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412805847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:57,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:18:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510361752] [2025-03-08 11:18:57,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:57,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:18:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:57,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:18:57,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:18:57,066 INFO L87 Difference]: Start difference. First operand 29791 states and 50865 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:19:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:02,156 INFO L93 Difference]: Finished difference Result 107755 states and 183725 transitions. [2025-03-08 11:19:02,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:19:02,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 767 [2025-03-08 11:19:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:02,367 INFO L225 Difference]: With dead ends: 107755 [2025-03-08 11:19:02,367 INFO L226 Difference]: Without dead ends: 78102 [2025-03-08 11:19:02,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 11:19:02,425 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 917 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:02,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1802 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:19:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78102 states. [2025-03-08 11:19:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78102 to 59006. [2025-03-08 11:19:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59006 states, 50230 states have (on average 1.695799323113677) internal successors, (85180), 50485 states have internal predecessors, (85180), 8075 states have call successors, (8075), 700 states have call predecessors, (8075), 700 states have return successors, (8075), 7820 states have call predecessors, (8075), 8075 states have call successors, (8075) [2025-03-08 11:19:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59006 states to 59006 states and 101330 transitions. [2025-03-08 11:19:06,805 INFO L78 Accepts]: Start accepts. Automaton has 59006 states and 101330 transitions. Word has length 767 [2025-03-08 11:19:06,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 59006 states and 101330 transitions. [2025-03-08 11:19:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-03-08 11:19:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 59006 states and 101330 transitions. [2025-03-08 11:19:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2025-03-08 11:19:06,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:06,847 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:19:06,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:19:06,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:06,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 996635364, now seen corresponding path program 1 times [2025-03-08 11:19:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481469772] [2025-03-08 11:19:06,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:06,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-03-08 11:19:06,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-03-08 11:19:06,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29524 trivial. 0 not checked. [2025-03-08 11:19:07,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:07,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481469772] [2025-03-08 11:19:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481469772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:07,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:07,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:19:07,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641905115] [2025-03-08 11:19:07,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:19:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:07,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:19:07,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:07,272 INFO L87 Difference]: Start difference. First operand 59006 states and 101330 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:19:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:10,475 INFO L93 Difference]: Finished difference Result 117970 states and 202651 transitions. [2025-03-08 11:19:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:19:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) Word has length 767 [2025-03-08 11:19:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:10,658 INFO L225 Difference]: With dead ends: 117970 [2025-03-08 11:19:10,658 INFO L226 Difference]: Without dead ends: 59102 [2025-03-08 11:19:10,754 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 11:19:10,755 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 503 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:10,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2369 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:19:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59102 states. [2025-03-08 11:19:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59102 to 59100. [2025-03-08 11:19:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59100 states, 50324 states have (on average 1.6944996423177807) internal successors, (85274), 50579 states have internal predecessors, (85274), 8075 states have call successors, (8075), 700 states have call predecessors, (8075), 700 states have return successors, (8075), 7820 states have call predecessors, (8075), 8075 states have call successors, (8075) [2025-03-08 11:19:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59100 states to 59100 states and 101424 transitions. [2025-03-08 11:19:14,870 INFO L78 Accepts]: Start accepts. Automaton has 59100 states and 101424 transitions. Word has length 767 [2025-03-08 11:19:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:14,871 INFO L471 AbstractCegarLoop]: Abstraction has 59100 states and 101424 transitions. [2025-03-08 11:19:14,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (122), 1 states have call predecessors, (122), 1 states have return successors, (122), 2 states have call predecessors, (122), 2 states have call successors, (122) [2025-03-08 11:19:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 59100 states and 101424 transitions. [2025-03-08 11:19:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2025-03-08 11:19:14,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:14,905 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:19:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:19:14,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash 491076739, now seen corresponding path program 1 times [2025-03-08 11:19:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129513338] [2025-03-08 11:19:14,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:14,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-03-08 11:19:15,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-03-08 11:19:15,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:15,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 306 proven. 57 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-03-08 11:19:15,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129513338] [2025-03-08 11:19:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129513338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159090891] [2025-03-08 11:19:15,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:15,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:15,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:15,534 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 11:19:15,535 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 11:19:15,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 767 statements into 1 equivalence classes. [2025-03-08 11:19:15,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 767 of 767 statements. [2025-03-08 11:19:15,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:15,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:15,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:19:15,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 8077 proven. 57 refuted. 0 times theorem prover too weak. 21390 trivial. 0 not checked. [2025-03-08 11:19:16,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 306 proven. 57 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-03-08 11:19:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159090891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:16,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 11:19:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629552708] [2025-03-08 11:19:16,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:19:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:16,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:19:16,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:19:16,313 INFO L87 Difference]: Start difference. First operand 59100 states and 101424 transitions. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 3 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 3 states have call predecessors, (161), 3 states have call successors, (161) [2025-03-08 11:19:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:19,808 INFO L93 Difference]: Finished difference Result 118864 states and 203442 transitions. [2025-03-08 11:19:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:19:19,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 3 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 3 states have call predecessors, (161), 3 states have call successors, (161) Word has length 767 [2025-03-08 11:19:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:19,976 INFO L225 Difference]: With dead ends: 118864 [2025-03-08 11:19:19,976 INFO L226 Difference]: Without dead ends: 59902 [2025-03-08 11:19:20,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1540 GetRequests, 1531 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:19:20,055 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1057 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:20,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 1187 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:19:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59902 states. [2025-03-08 11:19:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59902 to 59140. [2025-03-08 11:19:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59140 states, 50354 states have (on average 1.6849505501052549) internal successors, (84844), 50609 states have internal predecessors, (84844), 8075 states have call successors, (8075), 710 states have call predecessors, (8075), 710 states have return successors, (8075), 7820 states have call predecessors, (8075), 8075 states have call successors, (8075) [2025-03-08 11:19:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59140 states to 59140 states and 100994 transitions. [2025-03-08 11:19:23,394 INFO L78 Accepts]: Start accepts. Automaton has 59140 states and 100994 transitions. Word has length 767 [2025-03-08 11:19:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:23,395 INFO L471 AbstractCegarLoop]: Abstraction has 59140 states and 100994 transitions. [2025-03-08 11:19:23,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 3 states have call successors, (160), 2 states have call predecessors, (160), 4 states have return successors, (161), 3 states have call predecessors, (161), 3 states have call successors, (161) [2025-03-08 11:19:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 59140 states and 100994 transitions. [2025-03-08 11:19:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2025-03-08 11:19:23,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:23,421 INFO L218 NwaCegarLoop]: trace histogram [122, 122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:19:23,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:19:23,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:23,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1007032839, now seen corresponding path program 1 times [2025-03-08 11:19:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127789877] [2025-03-08 11:19:23,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:23,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-03-08 11:19:23,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-03-08 11:19:23,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:23,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 213 proven. 150 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-03-08 11:19:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127789877] [2025-03-08 11:19:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127789877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048106516] [2025-03-08 11:19:24,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:24,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:24,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:24,168 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 11:19:24,169 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 11:19:24,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-03-08 11:19:24,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-03-08 11:19:24,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:24,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:24,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:19:24,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 14463 proven. 150 refuted. 0 times theorem prover too weak. 14911 trivial. 0 not checked. [2025-03-08 11:19:24,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 29524 backedges. 213 proven. 150 refuted. 0 times theorem prover too weak. 29161 trivial. 0 not checked. [2025-03-08 11:19:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048106516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:25,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 11:19:25,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201026300] [2025-03-08 11:19:25,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:25,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:19:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:25,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:19:25,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:19:25,430 INFO L87 Difference]: Start difference. First operand 59140 states and 100994 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 14 states have internal predecessors, (246), 3 states have call successors, (222), 2 states have call predecessors, (222), 4 states have return successors, (223), 3 states have call predecessors, (223), 3 states have call successors, (223)