./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -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 f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:44:12,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:44:12,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:44:12,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:44:12,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:44:12,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:44:12,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:44:12,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:44:12,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:44:12,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:44:12,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:44:12,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:44:12,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:44:12,833 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:44:12,834 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:12,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:44:12,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:44:12,834 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2025-03-03 09:44:13,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:44:13,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:44:13,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:44:13,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:44:13,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:44:13,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-03 09:44:14,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0f5ad06/c58ec03fb215495bb1dce86758497c35/FLAG211538d7c [2025-03-03 09:44:14,477 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:44:14,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-03 09:44:14,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0f5ad06/c58ec03fb215495bb1dce86758497c35/FLAG211538d7c [2025-03-03 09:44:14,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0f5ad06/c58ec03fb215495bb1dce86758497c35 [2025-03-03 09:44:14,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:44:14,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:44:14,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:14,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:44:14,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:44:14,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:14,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48531b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14, skipping insertion in model container [2025-03-03 09:44:14,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:14,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:44:14,898 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/bitvector/soft_float_2a.c.cil.c[728,741] [2025-03-03 09:44:14,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:14,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:44:14,943 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/bitvector/soft_float_2a.c.cil.c[728,741] [2025-03-03 09:44:14,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:44:14,985 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:44:14,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14 WrapperNode [2025-03-03 09:44:14,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:44:14,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:14,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:44:14,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:44:14,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:14,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,013 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 147 [2025-03-03 09:44:15,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:44:15,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:44:15,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:44:15,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:44:15,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,031 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-03 09:44:15,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:44:15,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:44:15,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:44:15,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:44:15,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (1/1) ... [2025-03-03 09:44:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:44:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:15,068 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-03 09:44:15,071 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-03 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-03 09:44:15,091 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-03 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:44:15,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:44:15,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 09:44:15,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 09:44:15,142 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:44:15,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:44:15,458 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-03-03 09:44:15,458 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:44:15,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:44:15,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:44:15,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:15 BoogieIcfgContainer [2025-03-03 09:44:15,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:44:15,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:44:15,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:44:15,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:44:15,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:14" (1/3) ... [2025-03-03 09:44:15,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77811b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:15, skipping insertion in model container [2025-03-03 09:44:15,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:14" (2/3) ... [2025-03-03 09:44:15,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77811b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:15, skipping insertion in model container [2025-03-03 09:44:15,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:15" (3/3) ... [2025-03-03 09:44:15,480 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2025-03-03 09:44:15,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:44:15,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_2a.c.cil.c that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:44:15,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:44:15,538 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;@569773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:44:15,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:44:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 68 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:44:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 09:44:15,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:15,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 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-03 09:44:15,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1259533842, now seen corresponding path program 1 times [2025-03-03 09:44:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993292015] [2025-03-03 09:44:15,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:15,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 09:44:15,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 09:44:15,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:44:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993292015] [2025-03-03 09:44:15,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993292015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:44:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317927453] [2025-03-03 09:44:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:15,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:15,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:15,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:15,816 INFO L87 Difference]: Start difference. First operand has 75 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 68 states have internal predecessors, (100), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:15,873 INFO L93 Difference]: Finished difference Result 175 states and 265 transitions. [2025-03-03 09:44:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-03 09:44:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:15,881 INFO L225 Difference]: With dead ends: 175 [2025-03-03 09:44:15,881 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 09:44:15,883 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-03 09:44:15,888 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:15,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 191 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 09:44:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 09:44:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 09:44:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2025-03-03 09:44:15,915 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 42 [2025-03-03 09:44:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2025-03-03 09:44:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2025-03-03 09:44:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:15,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:15,918 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 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-03 09:44:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:44:15,918 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:15,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1167943253, now seen corresponding path program 1 times [2025-03-03 09:44:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647115692] [2025-03-03 09:44:15,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:15,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:15,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:15,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:15,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:44:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647115692] [2025-03-03 09:44:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647115692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:44:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841167548] [2025-03-03 09:44:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:16,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:16,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:16,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:44:16,071 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:16,113 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2025-03-03 09:44:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-03-03 09:44:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:16,114 INFO L225 Difference]: With dead ends: 106 [2025-03-03 09:44:16,114 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 09:44:16,114 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-03 09:44:16,115 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 35 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:16,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 265 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 09:44:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 09:44:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 09:44:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2025-03-03 09:44:16,120 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 44 [2025-03-03 09:44:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:16,120 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2025-03-03 09:44:16,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2025-03-03 09:44:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:44:16,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:16,122 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 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-03 09:44:16,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:44:16,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:16,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1461346260, now seen corresponding path program 1 times [2025-03-03 09:44:16,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217175414] [2025-03-03 09:44:16,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:16,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:16,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:16,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217175414] [2025-03-03 09:44:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217175414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903763376] [2025-03-03 09:44:16,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:16,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:16,276 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-03 09:44:16,277 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-03 09:44:16,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 09:44:16,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:44:16,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:44:16,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:16,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903763376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:44:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274477939] [2025-03-03 09:44:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:16,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:16,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:16,394 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:16,511 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2025-03-03 09:44:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-03 09:44:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:16,514 INFO L225 Difference]: With dead ends: 156 [2025-03-03 09:44:16,514 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 09:44:16,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:16,515 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:16,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 208 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 09:44:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2025-03-03 09:44:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 09:44:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2025-03-03 09:44:16,527 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 44 [2025-03-03 09:44:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2025-03-03 09:44:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2025-03-03 09:44:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:44:16,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:16,529 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:16,535 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-03 09:44:16,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:16,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:16,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1659071847, now seen corresponding path program 1 times [2025-03-03 09:44:16,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:16,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-03-03 09:44:16,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:16,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:16,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:16,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-03-03 09:44:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558157259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597696000] [2025-03-03 09:44:16,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:16,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:16,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:16,807 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-03 09:44:16,809 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-03 09:44:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:44:16,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:44:16,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:16,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:16,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:16,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:16,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597696000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:44:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490876446] [2025-03-03 09:44:16,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:16,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:16,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:16,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:16,898 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:16,953 INFO L93 Difference]: Finished difference Result 172 states and 242 transitions. [2025-03-03 09:44:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-03 09:44:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:16,964 INFO L225 Difference]: With dead ends: 172 [2025-03-03 09:44:16,964 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 09:44:16,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:16,965 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:16,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 223 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 09:44:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2025-03-03 09:44:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-03 09:44:16,978 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 47 [2025-03-03 09:44:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:16,979 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-03 09:44:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-03 09:44:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:44:16,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:16,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:16,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:17,180 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,SelfDestructingSolverStorable3 [2025-03-03 09:44:17,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:17,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1790861242, now seen corresponding path program 1 times [2025-03-03 09:44:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:17,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987451562] [2025-03-03 09:44:17,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:17,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:17,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987451562] [2025-03-03 09:44:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987451562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144904281] [2025-03-03 09:44:17,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:17,267 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-03 09:44:17,268 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-03 09:44:17,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 09:44:17,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 09:44:17,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:17,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:17,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144904281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:17,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:17,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:44:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873951339] [2025-03-03 09:44:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:44:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:17,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:44:17,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:17,353 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:17,412 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2025-03-03 09:44:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:44:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-03-03 09:44:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:17,413 INFO L225 Difference]: With dead ends: 178 [2025-03-03 09:44:17,413 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 09:44:17,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:17,414 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 16 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:17,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 09:44:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2025-03-03 09:44:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 80 states have internal predecessors, (110), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-03 09:44:17,420 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 48 [2025-03-03 09:44:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:17,420 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-03 09:44:17,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-03 09:44:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 09:44:17,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:17,422 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:17,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:17,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:17,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:17,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash -175969768, now seen corresponding path program 1 times [2025-03-03 09:44:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:17,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076479669] [2025-03-03 09:44:17,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:17,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:17,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:17,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076479669] [2025-03-03 09:44:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076479669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890088326] [2025-03-03 09:44:17,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:17,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:17,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:17,715 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-03 09:44:17,716 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-03 09:44:17,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 09:44:17,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 09:44:17,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:17,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:17,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:17,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:17,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890088326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:17,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:17,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 09:44:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920542755] [2025-03-03 09:44:17,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:17,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:17,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:17,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:17,915 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 09:44:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:18,045 INFO L93 Difference]: Finished difference Result 229 states and 330 transitions. [2025-03-03 09:44:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2025-03-03 09:44:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:18,046 INFO L225 Difference]: With dead ends: 229 [2025-03-03 09:44:18,046 INFO L226 Difference]: Without dead ends: 148 [2025-03-03 09:44:18,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:18,047 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 124 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:18,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 334 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-03 09:44:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2025-03-03 09:44:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 94 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-03-03 09:44:18,061 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 50 [2025-03-03 09:44:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:18,061 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-03-03 09:44:18,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 09:44:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-03-03 09:44:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:44:18,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:18,062 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:18,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:44:18,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:18,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:18,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash 62808603, now seen corresponding path program 1 times [2025-03-03 09:44:18,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:18,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280699377] [2025-03-03 09:44:18,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:18,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:44:18,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:44:18,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280699377] [2025-03-03 09:44:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280699377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63937250] [2025-03-03 09:44:18,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:18,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:18,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:18,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:44:18,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:44:18,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:44:18,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:18,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:44:18,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63937250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:18,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 09:44:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875862172] [2025-03-03 09:44:18,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:44:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:44:18,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:44:18,540 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 09:44:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:18,656 INFO L93 Difference]: Finished difference Result 248 states and 362 transitions. [2025-03-03 09:44:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:18,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2025-03-03 09:44:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:18,658 INFO L225 Difference]: With dead ends: 248 [2025-03-03 09:44:18,658 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 09:44:18,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:18,659 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 126 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:18,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 395 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 09:44:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2025-03-03 09:44:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 103 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-03-03 09:44:18,674 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 51 [2025-03-03 09:44:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-03-03 09:44:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 09:44:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-03-03 09:44:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:44:18,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:18,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:18,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:44:18,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:18,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2104415834, now seen corresponding path program 1 times [2025-03-03 09:44:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347640761] [2025-03-03 09:44:18,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:18,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:18,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:18,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:18,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:18,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347640761] [2025-03-03 09:44:18,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347640761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:18,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705596206] [2025-03-03 09:44:18,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:18,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:18,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:44:18,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:18,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:18,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:18,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:18,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:44:18,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:18,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705596206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:18,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:18,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-03 09:44:18,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444598991] [2025-03-03 09:44:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:18,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:18,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:18,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:18,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:18,973 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:19,023 INFO L93 Difference]: Finished difference Result 220 states and 326 transitions. [2025-03-03 09:44:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-03-03 09:44:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:19,024 INFO L225 Difference]: With dead ends: 220 [2025-03-03 09:44:19,024 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 09:44:19,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-03 09:44:19,025 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:19,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 162 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 09:44:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2025-03-03 09:44:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 100 states have internal predecessors, (142), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-03 09:44:19,031 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 52 [2025-03-03 09:44:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:19,031 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-03 09:44:19,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-03 09:44:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 09:44:19,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:19,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:19,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:19,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:19,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1256698923, now seen corresponding path program 1 times [2025-03-03 09:44:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498675139] [2025-03-03 09:44:19,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:19,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:19,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:19,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:19,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498675139] [2025-03-03 09:44:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498675139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890629663] [2025-03-03 09:44:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:19,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:19,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:19,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:19,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:44:19,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 09:44:19,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 09:44:19,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:19,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:19,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:44:19,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:19,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890629663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:19,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:19,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-03 09:44:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116860660] [2025-03-03 09:44:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:19,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:19,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:19,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:19,342 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:19,374 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2025-03-03 09:44:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:19,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-03-03 09:44:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:19,376 INFO L225 Difference]: With dead ends: 217 [2025-03-03 09:44:19,376 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 09:44:19,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:44:19,377 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:19,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 163 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 09:44:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2025-03-03 09:44:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.42) internal successors, (142), 101 states have internal predecessors, (142), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-03 09:44:19,391 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 52 [2025-03-03 09:44:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:19,391 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-03 09:44:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-03 09:44:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:19,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:19,392 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:19,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:19,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:19,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:19,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash -818647499, now seen corresponding path program 1 times [2025-03-03 09:44:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983024806] [2025-03-03 09:44:19,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:19,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:19,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:19,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:19,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:19,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983024806] [2025-03-03 09:44:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983024806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:19,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059151684] [2025-03-03 09:44:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:19,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:19,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:19,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:44:19,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:19,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:19,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:19,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:19,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:44:19,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:19,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059151684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:19,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:19,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:44:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548090382] [2025-03-03 09:44:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:19,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:44:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:19,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:44:19,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:19,775 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:19,814 INFO L93 Difference]: Finished difference Result 218 states and 314 transitions. [2025-03-03 09:44:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:44:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-03 09:44:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:19,816 INFO L225 Difference]: With dead ends: 218 [2025-03-03 09:44:19,816 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 09:44:19,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:44:19,816 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 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-03 09:44:19,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 09:44:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2025-03-03 09:44:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-03-03 09:44:19,826 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 53 [2025-03-03 09:44:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:19,826 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-03-03 09:44:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-03-03 09:44:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:19,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:19,827 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:19,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:44:20,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:44:20,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:20,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:20,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1048675026, now seen corresponding path program 1 times [2025-03-03 09:44:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927107377] [2025-03-03 09:44:20,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:20,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:20,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:20,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:20,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:20,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:20,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927107377] [2025-03-03 09:44:20,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927107377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435251004] [2025-03-03 09:44:20,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:20,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:20,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:20,120 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:20,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:44:20,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:20,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:20,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:44:20,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:20,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:20,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435251004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:20,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:20,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-03 09:44:20,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636072056] [2025-03-03 09:44:20,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:20,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:44:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:20,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:44:20,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:44:20,204 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:20,256 INFO L93 Difference]: Finished difference Result 155 states and 218 transitions. [2025-03-03 09:44:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2025-03-03 09:44:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:20,257 INFO L225 Difference]: With dead ends: 155 [2025-03-03 09:44:20,257 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 09:44:20,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:44:20,258 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:20,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 09:44:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-03 09:44:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 112 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 09:44:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2025-03-03 09:44:20,265 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 53 [2025-03-03 09:44:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:20,265 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2025-03-03 09:44:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2025-03-03 09:44:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:44:20,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:20,266 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:20,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:44:20,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:20,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:20,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash 852161521, now seen corresponding path program 1 times [2025-03-03 09:44:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432037969] [2025-03-03 09:44:20,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:20,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:20,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:20,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:20,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:44:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432037969] [2025-03-03 09:44:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432037969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782153656] [2025-03-03 09:44:20,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:20,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:20,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:20,535 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:20,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:44:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 09:44:20,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:44:20,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:20,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:20,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:44:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:20,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782153656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:20,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-03 09:44:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791982535] [2025-03-03 09:44:20,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:44:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:44:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:44:20,737 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 09:44:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:20,945 INFO L93 Difference]: Finished difference Result 251 states and 350 transitions. [2025-03-03 09:44:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 53 [2025-03-03 09:44:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:20,947 INFO L225 Difference]: With dead ends: 251 [2025-03-03 09:44:20,947 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 09:44:20,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:44:20,948 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 96 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:20,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 618 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 09:44:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2025-03-03 09:44:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 103 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 09:44:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2025-03-03 09:44:20,961 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 53 [2025-03-03 09:44:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:20,962 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2025-03-03 09:44:20,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 09:44:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2025-03-03 09:44:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:44:20,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:20,963 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:20,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:21,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:44:21,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1506882580, now seen corresponding path program 1 times [2025-03-03 09:44:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172564041] [2025-03-03 09:44:21,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:21,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:21,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:21,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172564041] [2025-03-03 09:44:21,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172564041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:21,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752142163] [2025-03-03 09:44:21,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:21,316 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:21,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:44:21,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:21,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:21,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:44:21,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:21,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:44:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752142163] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:44:21,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 9] total 12 [2025-03-03 09:44:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539870023] [2025-03-03 09:44:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:21,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:44:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:21,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:44:21,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:21,495 INFO L87 Difference]: Start difference. First operand 112 states and 152 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:21,543 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2025-03-03 09:44:21,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2025-03-03 09:44:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:21,545 INFO L225 Difference]: With dead ends: 123 [2025-03-03 09:44:21,545 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 09:44:21,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:44:21,545 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:21,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 09:44:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-03 09:44:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 09:44:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions. [2025-03-03 09:44:21,556 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 56 [2025-03-03 09:44:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 157 transitions. [2025-03-03 09:44:21,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions. [2025-03-03 09:44:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:44:21,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:21,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:21,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:44:21,758 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:21,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1535511731, now seen corresponding path program 1 times [2025-03-03 09:44:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806813623] [2025-03-03 09:44:21,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:21,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 09:44:21,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:44:21,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:44:21,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:21,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806813623] [2025-03-03 09:44:21,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806813623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:21,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:21,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 09:44:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863707310] [2025-03-03 09:44:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:21,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:21,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:21,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:21,817 INFO L87 Difference]: Start difference. First operand 117 states and 157 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:21,850 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2025-03-03 09:44:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:44:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2025-03-03 09:44:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:21,851 INFO L225 Difference]: With dead ends: 123 [2025-03-03 09:44:21,851 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 09:44:21,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:44:21,852 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:21,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:44:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 09:44:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-03 09:44:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 97 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 09:44:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2025-03-03 09:44:21,858 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 56 [2025-03-03 09:44:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:21,858 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2025-03-03 09:44:21,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2025-03-03 09:44:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 09:44:21,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:21,859 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:44:21,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1674351194, now seen corresponding path program 1 times [2025-03-03 09:44:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707149777] [2025-03-03 09:44:21,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:21,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 09:44:21,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 09:44:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:21,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:44:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707149777] [2025-03-03 09:44:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707149777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750896363] [2025-03-03 09:44:21,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:21,983 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:21,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:44:22,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 09:44:22,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 09:44:22,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:44:22,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:44:22,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750896363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:22,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-03 09:44:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989968973] [2025-03-03 09:44:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:22,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:22,107 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:22,185 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2025-03-03 09:44:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2025-03-03 09:44:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:22,186 INFO L225 Difference]: With dead ends: 153 [2025-03-03 09:44:22,186 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 09:44:22,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:22,187 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:22,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 628 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 09:44:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2025-03-03 09:44:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 107 states have internal predecessors, (135), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 09:44:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2025-03-03 09:44:22,193 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 65 [2025-03-03 09:44:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:22,193 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2025-03-03 09:44:22,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2025-03-03 09:44:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 09:44:22,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:22,194 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:22,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:22,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:44:22,396 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1267306405, now seen corresponding path program 1 times [2025-03-03 09:44:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:22,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318452047] [2025-03-03 09:44:22,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:22,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 09:44:22,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 09:44:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:44:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318452047] [2025-03-03 09:44:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318452047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195371463] [2025-03-03 09:44:22,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:22,543 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:22,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:44:22,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 09:44:22,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 09:44:22,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:22,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:22,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 09:44:22,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:44:22,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:44:22,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195371463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:22,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 14] total 25 [2025-03-03 09:44:22,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682087438] [2025-03-03 09:44:22,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:22,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:44:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:44:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:44:22,920 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 21 states have internal predecessors, (77), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 09:44:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:23,097 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2025-03-03 09:44:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:44:23,098 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 21 states have internal predecessors, (77), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 09:44:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:23,099 INFO L225 Difference]: With dead ends: 165 [2025-03-03 09:44:23,099 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 09:44:23,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:44:23,100 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:23,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1408 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 09:44:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-03 09:44:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.264957264957265) internal successors, (148), 118 states have internal predecessors, (148), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-03 09:44:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 169 transitions. [2025-03-03 09:44:23,108 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 169 transitions. Word has length 65 [2025-03-03 09:44:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,109 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 169 transitions. [2025-03-03 09:44:23,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 21 states have internal predecessors, (77), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 09:44:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 169 transitions. [2025-03-03 09:44:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:44:23,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,110 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:23,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:44:23,314 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1929183058, now seen corresponding path program 1 times [2025-03-03 09:44:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021142785] [2025-03-03 09:44:23,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 09:44:23,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:44:23,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:44:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021142785] [2025-03-03 09:44:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021142785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:23,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264798320] [2025-03-03 09:44:23,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:23,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:23,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:23,436 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:23,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:44:23,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 09:44:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:44:23,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:23,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:23,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:44:23,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:44:23,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:44:23,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264798320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:23,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:23,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 09:44:23,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894943284] [2025-03-03 09:44:23,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:23,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:44:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:23,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:44:23,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:23,588 INFO L87 Difference]: Start difference. First operand 130 states and 169 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:44:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:23,672 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2025-03-03 09:44:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:23,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2025-03-03 09:44:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:23,673 INFO L225 Difference]: With dead ends: 166 [2025-03-03 09:44:23,673 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 09:44:23,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:44:23,674 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:23,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 857 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 09:44:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 09:44:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 104 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:44:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2025-03-03 09:44:23,681 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 67 [2025-03-03 09:44:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:23,682 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2025-03-03 09:44:23,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:44:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2025-03-03 09:44:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 09:44:23,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:23,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:23,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:44:23,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:23,883 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1422734965, now seen corresponding path program 2 times [2025-03-03 09:44:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:23,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132299449] [2025-03-03 09:44:23,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:23,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-03 09:44:23,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 69 statements. [2025-03-03 09:44:23,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 09:44:23,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:44:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:24,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132299449] [2025-03-03 09:44:24,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132299449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:24,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:44:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:44:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174900399] [2025-03-03 09:44:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:44:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:24,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:44:24,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:24,017 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:24,081 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2025-03-03 09:44:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:44:24,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2025-03-03 09:44:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:24,082 INFO L225 Difference]: With dead ends: 147 [2025-03-03 09:44:24,082 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 09:44:24,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:44:24,083 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:24,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 556 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 09:44:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-03 09:44:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 110 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 09:44:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2025-03-03 09:44:24,090 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 69 [2025-03-03 09:44:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:24,091 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2025-03-03 09:44:24,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-03 09:44:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2025-03-03 09:44:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:44:24,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:24,092 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:24,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 09:44:24,092 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1925228616, now seen corresponding path program 2 times [2025-03-03 09:44:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139264012] [2025-03-03 09:44:24,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:24,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-03 09:44:24,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:44:24,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:44:24,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139264012] [2025-03-03 09:44:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139264012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27363229] [2025-03-03 09:44:24,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:44:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:24,265 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:24,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:44:24,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-03 09:44:24,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:44:24,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:44:24,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:44:24,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:44:24,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:44:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27363229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:44:24,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:44:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2025-03-03 09:44:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36179835] [2025-03-03 09:44:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:44:24,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:44:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:24,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:44:24,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:24,408 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:24,477 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2025-03-03 09:44:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:44:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 71 [2025-03-03 09:44:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:24,478 INFO L225 Difference]: With dead ends: 167 [2025-03-03 09:44:24,478 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 09:44:24,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:44:24,478 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:24,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 617 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 09:44:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2025-03-03 09:44:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 116 states have internal predecessors, (143), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-03 09:44:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2025-03-03 09:44:24,485 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 71 [2025-03-03 09:44:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:24,485 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2025-03-03 09:44:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:44:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2025-03-03 09:44:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:44:24,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:24,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:24,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:24,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 331429934, now seen corresponding path program 1 times [2025-03-03 09:44:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804742764] [2025-03-03 09:44:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:24,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:44:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:44:24,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:24,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804742764] [2025-03-03 09:44:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804742764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936862795] [2025-03-03 09:44:24,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:24,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:24,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:24,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:24,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:44:24,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:44:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:44:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:24,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:44:24,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:44:24,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:44:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936862795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:25,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-03-03 09:44:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649043939] [2025-03-03 09:44:25,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:25,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:44:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:25,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:44:25,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:44:25,120 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 19 states have internal predecessors, (88), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 09:44:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:25,243 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2025-03-03 09:44:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 19 states have internal predecessors, (88), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 71 [2025-03-03 09:44:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:25,245 INFO L225 Difference]: With dead ends: 173 [2025-03-03 09:44:25,245 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 09:44:25,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:44:25,245 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 45 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:25,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1102 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:44:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 09:44:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 09:44:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 110 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 09:44:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2025-03-03 09:44:25,252 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 71 [2025-03-03 09:44:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:25,252 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2025-03-03 09:44:25,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 19 states have internal predecessors, (88), 6 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 09:44:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2025-03-03 09:44:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 09:44:25,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:25,254 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:44:25,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 09:44:25,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:25,455 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:25,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:25,455 INFO L85 PathProgramCache]: Analyzing trace with hash -876367648, now seen corresponding path program 1 times [2025-03-03 09:44:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:25,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507534270] [2025-03-03 09:44:25,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:25,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 09:44:25,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 09:44:25,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:25,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 09:44:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507534270] [2025-03-03 09:44:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507534270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133935686] [2025-03-03 09:44:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:25,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:25,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:25,542 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:25,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:44:25,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 09:44:25,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 09:44:25,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:25,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:25,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 09:44:25,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:26,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:44:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133935686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:26,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16, 16] total 33 [2025-03-03 09:44:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791683746] [2025-03-03 09:44:26,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:26,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 09:44:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:26,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 09:44:26,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:44:26,948 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand has 33 states, 32 states have (on average 3.59375) internal successors, (115), 29 states have internal predecessors, (115), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-03 09:44:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:27,902 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2025-03-03 09:44:27,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 09:44:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.59375) internal successors, (115), 29 states have internal predecessors, (115), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 76 [2025-03-03 09:44:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:27,903 INFO L225 Difference]: With dead ends: 236 [2025-03-03 09:44:27,903 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:44:27,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=2682, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 09:44:27,904 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:27,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 440 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:44:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:44:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:44:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:44:27,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2025-03-03 09:44:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:27,905 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:44:27,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.59375) internal successors, (115), 29 states have internal predecessors, (115), 7 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-03 09:44:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:44:27,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:44:27,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:44:27,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:28,113 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:44:28,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:44:28,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:44:28,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:28 BoogieIcfgContainer [2025-03-03 09:44:28,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:44:28,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:44:28,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:44:28,305 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:44:28,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:15" (3/4) ... [2025-03-03 09:44:28,307 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:44:28,311 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-03 09:44:28,311 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-03 09:44:28,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-03 09:44:28,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-03 09:44:28,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:44:28,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:44:28,332 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((e == \old(e)) && (m <= 33554431)) && ((m == 1) || (m == \old(m)))) || (((((e <= \old(e)) && ((m % 2) == 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (m <= 33554431))) && (0 < \old(m))) [2025-03-03 09:44:28,333 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(e) <= e) && (0 < \old(m))) && (\old(m) != 1)) [2025-03-03 09:44:28,348 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(e) <= e) && (0 < \old(m))) && (\old(m) != 1)) [2025-03-03 09:44:28,349 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((e == \old(e)) && (m <= 33554431)) && ((m == 1) || (m == \old(m)))) || (((((e <= \old(e)) && ((m % 2) == 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (m <= 33554431))) && (0 < \old(m))) [2025-03-03 09:44:28,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:44:28,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:44:28,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:44:28,377 INFO L158 Benchmark]: Toolchain (without parser) took 13585.21ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.1MB in the beginning and 118.2MB in the end (delta: -5.2MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,377 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:28,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.12ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.03ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,378 INFO L158 Benchmark]: Boogie Preprocessor took 26.83ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:28,378 INFO L158 Benchmark]: IcfgBuilder took 431.70ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 74.5MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,379 INFO L158 Benchmark]: TraceAbstraction took 12829.02ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.8MB in the beginning and 126.5MB in the end (delta: -52.7MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,379 INFO L158 Benchmark]: Witness Printer took 70.76ms. Allocated memory is still 218.1MB. Free memory was 126.5MB in the beginning and 118.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:28,381 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.12ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.6MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.03ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.83ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 431.70ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 74.5MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12829.02ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 73.8MB in the beginning and 126.5MB in the end (delta: -52.7MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 70.76ms. Allocated memory is still 218.1MB. Free memory was 126.5MB in the beginning and 118.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 628 mSDsluCounter, 9796 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8100 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3224 IncrementalHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 1696 mSDtfsCounter, 3224 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1607 GetRequests, 1385 SyntacticMatches, 2 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=16, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 179 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2159 NumberOfCodeBlocks, 2124 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2602 ConstructedInterpolants, 0 QuantifiedInterpolants, 5236 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2977 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 46 InterpolantComputations, 14 PerfectInterpolantSequences, 1232/1472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: (((((e == \old(e)) && (m <= 33554431)) && ((m == 1) || (m == \old(m)))) || (((((e <= \old(e)) && ((m % 2) == 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (m <= 33554431))) && (0 < \old(m))) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: (((\old(e) <= e) && (0 < \old(m))) && (\old(m) != 1)) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:44:28,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE