./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:33:02,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:33:02,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:33:02,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:33:02,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:33:02,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:33:02,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:33:02,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:33:02,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:33:02,834 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:33:02,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:33:02,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:33:02,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:33:02,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:33:02,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:33:02,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:33:02,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:33:02,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:33:02,836 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 -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc [2025-03-03 13:33:03,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:33:03,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:33:03,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:33:03,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:33:03,051 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:33:03,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-03-03 13:33:04,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8f8277d/501f98e4b971464bb8e4904ae55d70d4/FLAGb784ea137 [2025-03-03 13:33:04,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:33:04,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-03-03 13:33:04,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8f8277d/501f98e4b971464bb8e4904ae55d70d4/FLAGb784ea137 [2025-03-03 13:33:04,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed8f8277d/501f98e4b971464bb8e4904ae55d70d4 [2025-03-03 13:33:04,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:33:04,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:33:04,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:33:04,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:33:04,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:33:04,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489b4d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04, skipping insertion in model container [2025-03-03 13:33:04,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:33:04,516 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/loop-lit/bh2017-ex-add.i[802,815] [2025-03-03 13:33:04,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:33:04,535 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:33:04,543 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/loop-lit/bh2017-ex-add.i[802,815] [2025-03-03 13:33:04,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:33:04,560 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:33:04,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04 WrapperNode [2025-03-03 13:33:04,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:33:04,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:33:04,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:33:04,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:33:04,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,581 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-03-03 13:33:04,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:33:04,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:33:04,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:33:04,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:33:04,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,604 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 13:33:04,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:33:04,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:33:04,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:33:04,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:33:04,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (1/1) ... [2025-03-03 13:33:04,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:33:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:04,641 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 13:33:04,644 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 13:33:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:33:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:33:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:33:04,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:33:04,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:33:04,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:33:04,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:33:04,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:33:04,815 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-03 13:33:04,816 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:33:04,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:33:04,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:33:04,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:33:04 BoogieIcfgContainer [2025-03-03 13:33:04,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:33:04,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:33:04,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:33:04,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:33:04,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:33:04" (1/3) ... [2025-03-03 13:33:04,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7096fe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:33:04, skipping insertion in model container [2025-03-03 13:33:04,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:33:04" (2/3) ... [2025-03-03 13:33:04,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7096fe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:33:04, skipping insertion in model container [2025-03-03 13:33:04,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:33:04" (3/3) ... [2025-03-03 13:33:04,833 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2025-03-03 13:33:04,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:33:04,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex-add.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:33:04,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:33:04,898 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;@cd42da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:33:04,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:33:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:33:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 13:33:04,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:04,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 13:33:04,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:04,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1597006071, now seen corresponding path program 1 times [2025-03-03 13:33:04,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202410164] [2025-03-03 13:33:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 13:33:04,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 13:33:04,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:04,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202410164] [2025-03-03 13:33:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202410164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:33:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819121151] [2025-03-03 13:33:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:05,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:33:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:05,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:33:05,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:33:05,131 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:33:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:05,199 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2025-03-03 13:33:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:33:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-03 13:33:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:05,205 INFO L225 Difference]: With dead ends: 49 [2025-03-03 13:33:05,205 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 13:33:05,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:33:05,209 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:05,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 13:33:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 13:33:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:33:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-03 13:33:05,237 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 6 [2025-03-03 13:33:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:05,237 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-03 13:33:05,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:33:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-03 13:33:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:33:05,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:05,238 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:33:05,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:05,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1400415558, now seen corresponding path program 1 times [2025-03-03 13:33:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392668861] [2025-03-03 13:33:05,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:05,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:33:05,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:33:05,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:05,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:05,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:33:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392668861] [2025-03-03 13:33:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392668861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:05,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:33:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173305378] [2025-03-03 13:33:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:05,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:33:05,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:05,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:33:05,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:33:05,341 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:33:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:05,370 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-03 13:33:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:33:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-03 13:33:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:05,371 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:33:05,371 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 13:33:05,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:33:05,372 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:05,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 13:33:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-03 13:33:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 13:33:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-03 13:33:05,379 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 11 [2025-03-03 13:33:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:05,380 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-03 13:33:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:33:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-03 13:33:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:33:05,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:05,381 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:33:05,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:05,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash -76748012, now seen corresponding path program 1 times [2025-03-03 13:33:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:05,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073785041] [2025-03-03 13:33:05,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:05,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:33:05,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:33:05,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:05,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:33:05,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:05,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073785041] [2025-03-03 13:33:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073785041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:05,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:33:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472701967] [2025-03-03 13:33:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:05,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:33:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:33:05,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:33:05,431 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:33:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:05,441 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-03-03 13:33:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:33:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-03 13:33:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:05,442 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:33:05,442 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 13:33:05,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:33:05,443 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:05,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 13:33:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-03 13:33:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 13:33:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-03-03 13:33:05,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 20 [2025-03-03 13:33:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:05,452 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-03-03 13:33:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:33:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-03-03 13:33:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:33:05,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:05,452 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:05,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:33:05,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:05,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -202083179, now seen corresponding path program 1 times [2025-03-03 13:33:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941527500] [2025-03-03 13:33:05,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:05,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:33:05,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:33:05,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:05,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:33:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941527500] [2025-03-03 13:33:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941527500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:05,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:05,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:33:05,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259106303] [2025-03-03 13:33:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:05,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:33:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:05,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:33:05,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:33:05,512 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:33:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:05,531 INFO L93 Difference]: Finished difference Result 104 states and 150 transitions. [2025-03-03 13:33:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:33:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-03 13:33:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:05,532 INFO L225 Difference]: With dead ends: 104 [2025-03-03 13:33:05,532 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 13:33:05,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:33:05,534 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:05,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 13:33:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-03 13:33:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 13:33:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-03-03 13:33:05,559 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 22 [2025-03-03 13:33:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-03-03 13:33:05,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:33:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-03-03 13:33:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 13:33:05,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:05,562 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:05,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:33:05,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:05,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1806603319, now seen corresponding path program 1 times [2025-03-03 13:33:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:05,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454185270] [2025-03-03 13:33:05,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:05,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:33:05,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:33:05,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:05,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:33:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454185270] [2025-03-03 13:33:05,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454185270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:05,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231905708] [2025-03-03 13:33:05,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:05,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:05,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:05,657 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 13:33:05,658 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 13:33:05,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 13:33:05,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 13:33:05,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:05,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:05,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 13:33:05,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:33:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:33:05,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:33:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:33:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231905708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:33:05,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:33:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:33:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886932710] [2025-03-03 13:33:05,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:33:05,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:33:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:05,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:33:05,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:05,821 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 13:33:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:05,875 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-03-03 13:33:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:33:05,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 36 [2025-03-03 13:33:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:05,877 INFO L225 Difference]: With dead ends: 192 [2025-03-03 13:33:05,877 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 13:33:05,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:05,878 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:05,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 96 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 13:33:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-03 13:33:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 99 states have internal predecessors, (147), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 13:33:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2025-03-03 13:33:05,897 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 36 [2025-03-03 13:33:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2025-03-03 13:33:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 13:33:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2025-03-03 13:33:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:33:05,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:05,899 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:05,904 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 13:33:06,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:06,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:06,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 755610090, now seen corresponding path program 1 times [2025-03-03 13:33:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772985954] [2025-03-03 13:33:06,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:06,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:33:06,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:33:06,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:06,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:33:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772985954] [2025-03-03 13:33:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772985954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379995697] [2025-03-03 13:33:06,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:33:06,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:06,149 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 13:33:06,150 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 13:33:06,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:33:06,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:33:06,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:33:06,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:06,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 13:33:06,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:33:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:33:06,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:33:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:33:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379995697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:33:06,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:33:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:33:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507829712] [2025-03-03 13:33:06,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:33:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:33:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:06,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:33:06,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:06,258 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 13:33:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:06,293 INFO L93 Difference]: Finished difference Result 414 states and 667 transitions. [2025-03-03 13:33:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:33:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2025-03-03 13:33:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:06,296 INFO L225 Difference]: With dead ends: 414 [2025-03-03 13:33:06,296 INFO L226 Difference]: Without dead ends: 286 [2025-03-03 13:33:06,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:06,297 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:06,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-03 13:33:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-03-03 13:33:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.5) internal successors, (333), 222 states have internal predecessors, (333), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 13:33:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 453 transitions. [2025-03-03 13:33:06,331 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 453 transitions. Word has length 38 [2025-03-03 13:33:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 453 transitions. [2025-03-03 13:33:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 13:33:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 453 transitions. [2025-03-03 13:33:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 13:33:06,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:06,336 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:06,343 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 13:33:06,542 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,SelfDestructingSolverStorable5 [2025-03-03 13:33:06,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:06,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash -152391192, now seen corresponding path program 2 times [2025-03-03 13:33:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:06,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252987963] [2025-03-03 13:33:06,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:33:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:06,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-03 13:33:06,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 13:33:06,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:33:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-03 13:33:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252987963] [2025-03-03 13:33:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252987963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:33:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201384571] [2025-03-03 13:33:06,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:33:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:33:06,710 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 13:33:06,711 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 13:33:06,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-03 13:33:06,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 13:33:06,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:33:06,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:06,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:33:06,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:33:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 13:33:06,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:33:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 13:33:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201384571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:33:07,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:33:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-03 13:33:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585214275] [2025-03-03 13:33:07,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:33:07,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:33:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:07,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:33:07,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:33:07,008 INFO L87 Difference]: Start difference. First operand 286 states and 453 transitions. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-03 13:33:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:07,158 INFO L93 Difference]: Finished difference Result 884 states and 1441 transitions. [2025-03-03 13:33:07,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:33:07,158 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 84 [2025-03-03 13:33:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:07,161 INFO L225 Difference]: With dead ends: 884 [2025-03-03 13:33:07,161 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 13:33:07,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:33:07,163 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 199 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:07,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 274 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:33:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 13:33:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-03 13:33:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 470 states have (on average 1.504255319148936) internal successors, (707), 469 states have internal predecessors, (707), 126 states have call successors, (126), 4 states have call predecessors, (126), 3 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 13:33:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 959 transitions. [2025-03-03 13:33:07,193 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 959 transitions. Word has length 84 [2025-03-03 13:33:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:07,194 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 959 transitions. [2025-03-03 13:33:07,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-03 13:33:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 959 transitions. [2025-03-03 13:33:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 13:33:07,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:33:07,200 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-03 13:33:07,205 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 13:33:07,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:33:07,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:33:07,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:33:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash 828747241, now seen corresponding path program 2 times [2025-03-03 13:33:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:33:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111012050] [2025-03-03 13:33:07,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:33:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:33:07,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-03 13:33:07,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 13:33:07,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:33:07,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:33:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-03 13:33:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:33:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111012050] [2025-03-03 13:33:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111012050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:33:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:33:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:33:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812017120] [2025-03-03 13:33:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:33:07,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:33:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:33:07,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:33:07,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:33:07,536 INFO L87 Difference]: Start difference. First operand 600 states and 959 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:33:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:33:07,578 INFO L93 Difference]: Finished difference Result 602 states and 960 transitions. [2025-03-03 13:33:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:33:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2025-03-03 13:33:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:33:07,580 INFO L225 Difference]: With dead ends: 602 [2025-03-03 13:33:07,580 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 13:33:07,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:33:07,581 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:33:07,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:33:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 13:33:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 13:33:07,582 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 13:33:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 13:33:07,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2025-03-03 13:33:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:33:07,583 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 13:33:07,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:33:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 13:33:07,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 13:33:07,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:33:07,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:33:07,587 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-03 13:33:07,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 13:33:08,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:33:08,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:33:08 BoogieIcfgContainer [2025-03-03 13:33:08,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:33:08,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:33:08,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:33:08,197 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:33:08,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:33:04" (3/4) ... [2025-03-03 13:33:08,199 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 13:33:08,203 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-03 13:33:08,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-03 13:33:08,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 13:33:08,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 13:33:08,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 13:33:08,264 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:33:08,264 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:33:08,264 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:33:08,265 INFO L158 Benchmark]: Toolchain (without parser) took 3872.58ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.7MB in the beginning and 128.1MB in the end (delta: -16.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2025-03-03 13:33:08,265 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:08,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.99ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 100.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:33:08,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.58ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 976.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:08,266 INFO L158 Benchmark]: Boogie Preprocessor took 29.92ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.6MB in the end (delta: 982.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:33:08,267 INFO L158 Benchmark]: IcfgBuilder took 211.22ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 87.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:33:08,267 INFO L158 Benchmark]: TraceAbstraction took 3370.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.2MB in the beginning and 134.9MB in the end (delta: -48.7MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2025-03-03 13:33:08,267 INFO L158 Benchmark]: Witness Printer took 67.52ms. Allocated memory is still 176.2MB. Free memory was 134.9MB in the beginning and 128.1MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:33:08,268 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.49ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.99ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 100.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.58ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 976.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.92ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.6MB in the end (delta: 982.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 211.22ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 87.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3370.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.2MB in the beginning and 134.9MB in the end (delta: -48.7MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * Witness Printer took 67.52ms. Allocated memory is still 176.2MB. Free memory was 134.9MB in the beginning and 128.1MB in the end (delta: 6.8MB). 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: 13]: 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 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 869 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 639 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 230 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 605 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1158/1348 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: 18]: Location Invariant Derived location invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2025-03-03 13:33:08,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE