./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex3.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 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:43:01,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:43:01,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:43:01,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:43:01,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:43:01,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:43:01,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:43:01,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:43:01,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:43:01,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:43:01,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:43:01,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:43:01,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:43:01,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:43:01,091 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:43:01,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:43:01,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:43:01,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:43:01,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:43:01,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:43:01,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:43:01,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:43:01,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:43:01,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:43:01,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:43:01,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:43:01,093 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 -> 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 [2025-03-08 04:43:01,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:43:01,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:43:01,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:43:01,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:43:01,326 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:43:01,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex3.i [2025-03-08 04:43:02,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24bb7751/f9ba2c50fdbe471793a93d26be4abc1a/FLAGd0a679d05 [2025-03-08 04:43:02,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:43:02,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex3.i [2025-03-08 04:43:02,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24bb7751/f9ba2c50fdbe471793a93d26be4abc1a/FLAGd0a679d05 [2025-03-08 04:43:02,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24bb7751/f9ba2c50fdbe471793a93d26be4abc1a [2025-03-08 04:43:02,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:43:02,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:43:02,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:43:02,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:43:02,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:43:02,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eed51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02, skipping insertion in model container [2025-03-08 04:43:02,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:43:02,803 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-ex3.i[799,812] [2025-03-08 04:43:02,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:43:02,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:43:02,824 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-ex3.i[799,812] [2025-03-08 04:43:02,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:43:02,838 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:43:02,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02 WrapperNode [2025-03-08 04:43:02,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:43:02,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:43:02,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:43:02,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:43:02,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,861 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-03-08 04:43:02,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:43:02,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:43:02,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:43:02,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:43:02,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,875 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 04:43:02,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:43:02,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:43:02,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:43:02,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:43:02,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (1/1) ... [2025-03-08 04:43:02,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:43:02,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:43:02,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:43:02,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:43:02,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:43:02,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:43:02,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:43:02,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:43:02,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:43:02,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:43:02,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:43:02,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:43:03,049 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-08 04:43:03,049 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:43:03,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:43:03,055 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:43:03,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:43:03 BoogieIcfgContainer [2025-03-08 04:43:03,055 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:43:03,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:43:03,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:43:03,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:43:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:43:02" (1/3) ... [2025-03-08 04:43:03,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e76ba5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:43:03, skipping insertion in model container [2025-03-08 04:43:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:43:02" (2/3) ... [2025-03-08 04:43:03,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e76ba5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:43:03, skipping insertion in model container [2025-03-08 04:43:03,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:43:03" (3/3) ... [2025-03-08 04:43:03,061 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2025-03-08 04:43:03,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:43:03,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex3.i that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:43:03,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:43:03,124 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;@79d789e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:43:03,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:43:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:43:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 04:43:03,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:03,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 04:43:03,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:03,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1508255703, now seen corresponding path program 1 times [2025-03-08 04:43:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275141055] [2025-03-08 04:43:03,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:03,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:03,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 04:43:03,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 04:43:03,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:03,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:03,297 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-08 04:43:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275141055] [2025-03-08 04:43:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275141055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:43:03,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:43:03,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:43:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725554988] [2025-03-08 04:43:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:43:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:43:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:03,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:43:03,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:43:03,316 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:43:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:03,365 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2025-03-08 04:43:03,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:43:03,370 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-08 04:43:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:03,373 INFO L225 Difference]: With dead ends: 45 [2025-03-08 04:43:03,374 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 04:43:03,376 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-08 04:43:03,379 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:43:03,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 04:43:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 04:43:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-08 04:43:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 04:43:03,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 6 [2025-03-08 04:43:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:03,402 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 04:43:03,402 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-08 04:43:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 04:43:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:43:03,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:03,403 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:03,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:43:03,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:03,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 528513827, now seen corresponding path program 1 times [2025-03-08 04:43:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:03,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479739772] [2025-03-08 04:43:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:43:03,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:43:03,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:03,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:03,491 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-08 04:43:03,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479739772] [2025-03-08 04:43:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479739772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:43:03,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:43:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:43:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698998679] [2025-03-08 04:43:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:43:03,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:43:03,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:03,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:43:03,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:43:03,496 INFO L87 Difference]: Start difference. First operand 24 states and 31 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-08 04:43:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:03,546 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-08 04:43:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:43:03,547 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-08 04:43:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:03,548 INFO L225 Difference]: With dead ends: 30 [2025-03-08 04:43:03,549 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 04:43:03,549 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-08 04:43:03,550 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 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-08 04:43:03,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 04:43:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 04:43:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-08 04:43:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-08 04:43:03,557 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2025-03-08 04:43:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:03,557 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-08 04:43:03,557 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-08 04:43:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-08 04:43:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:43:03,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:03,558 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:03,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:43:03,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1678166709, now seen corresponding path program 1 times [2025-03-08 04:43:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:03,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53163898] [2025-03-08 04:43:03,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:03,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:03,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:43:03,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:43:03,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:03,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:03,613 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-08 04:43:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53163898] [2025-03-08 04:43:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53163898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:43:03,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:43:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:43:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585451021] [2025-03-08 04:43:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:43:03,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:43:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:03,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:43:03,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:43:03,614 INFO L87 Difference]: Start difference. First operand 28 states and 34 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-08 04:43:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:03,625 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2025-03-08 04:43:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:43:03,625 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-08 04:43:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:03,626 INFO L225 Difference]: With dead ends: 64 [2025-03-08 04:43:03,626 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:43:03,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:43:03,627 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 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-08 04:43:03,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:43:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 04:43:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 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-08 04:43:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-03-08 04:43:03,637 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 20 [2025-03-08 04:43:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:03,637 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-03-08 04:43:03,637 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-08 04:43:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-03-08 04:43:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:43:03,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:03,637 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:43:03,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -446320048, now seen corresponding path program 1 times [2025-03-08 04:43:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674582040] [2025-03-08 04:43:03,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:43:03,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:43:03,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:03,690 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-08 04:43:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674582040] [2025-03-08 04:43:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674582040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:43:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:43:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:43:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304151553] [2025-03-08 04:43:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:43:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:43:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:03,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:43:03,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:43:03,692 INFO L87 Difference]: Start difference. First operand 38 states and 51 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-08 04:43:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:03,701 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2025-03-08 04:43:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:43:03,702 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-08 04:43:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:03,702 INFO L225 Difference]: With dead ends: 92 [2025-03-08 04:43:03,702 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 04:43:03,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:43:03,703 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 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-08 04:43:03,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:03,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 04:43:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 04:43:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 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-08 04:43:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-03-08 04:43:03,713 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 20 [2025-03-08 04:43:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:03,713 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-03-08 04:43:03,713 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-08 04:43:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-03-08 04:43:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:43:03,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:03,714 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:03,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:43:03,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:03,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1527614388, now seen corresponding path program 1 times [2025-03-08 04:43:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861697820] [2025-03-08 04:43:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:03,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:03,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:43:03,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:43:03,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:03,780 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-08 04:43:03,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:03,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861697820] [2025-03-08 04:43:03,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861697820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:43:03,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737908682] [2025-03-08 04:43:03,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:03,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:43:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:43:03,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:43:03,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:43:03,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:43:03,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:43:03,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:03,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:03,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:43:03,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:43:03,888 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-08 04:43:03,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:43:03,952 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-08 04:43:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737908682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:43:03,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:43:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 04:43:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091931900] [2025-03-08 04:43:03,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:43:03,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:43:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:03,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:43:03,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:43:03,953 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 04:43:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:04,007 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2025-03-08 04:43:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:43:04,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 34 [2025-03-08 04:43:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:04,009 INFO L225 Difference]: With dead ends: 164 [2025-03-08 04:43:04,011 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 04:43:04,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-08 04:43:04,012 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 49 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:43:04,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 04:43:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 04:43:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 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-08 04:43:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2025-03-08 04:43:04,030 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 34 [2025-03-08 04:43:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:04,031 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2025-03-08 04:43:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 04:43:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2025-03-08 04:43:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:43:04,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:04,032 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:04,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:43:04,238 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-08 04:43:04,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -653452160, now seen corresponding path program 1 times [2025-03-08 04:43:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371021731] [2025-03-08 04:43:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:04,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:43:04,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:43:04,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:04,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:04,278 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-08 04:43:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371021731] [2025-03-08 04:43:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371021731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:43:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127322092] [2025-03-08 04:43:04,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:43:04,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:43:04,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:43:04,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:43:04,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:43:04,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:43:04,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:43:04,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:43:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:04,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:43:04,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:43:04,343 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-08 04:43:04,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:43:04,378 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-08 04:43:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127322092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:43:04,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:43:04,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 04:43:04,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723305847] [2025-03-08 04:43:04,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:43:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:43:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:04,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:43:04,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:43:04,379 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 04:43:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:04,423 INFO L93 Difference]: Finished difference Result 344 states and 562 transitions. [2025-03-08 04:43:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:43:04,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 34 [2025-03-08 04:43:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:04,425 INFO L225 Difference]: With dead ends: 344 [2025-03-08 04:43:04,427 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 04:43:04,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-08 04:43:04,429 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:43:04,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 04:43:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-08 04:43:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 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-08 04:43:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 378 transitions. [2025-03-08 04:43:04,456 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 378 transitions. Word has length 34 [2025-03-08 04:43:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:04,456 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 378 transitions. [2025-03-08 04:43:04,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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-08 04:43:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 378 transitions. [2025-03-08 04:43:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 04:43:04,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:04,459 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:04,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:43:04,659 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-08 04:43:04,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:04,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1116555375, now seen corresponding path program 2 times [2025-03-08 04:43:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:04,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-08 04:43:04,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:43:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:04,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 04:43:04,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 04:43:04,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:43:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-08 04:43:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-08 04:43:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145625381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:43:04,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:43:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:43:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364333139] [2025-03-08 04:43:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:43:04,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:43:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:04,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:43:04,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:43:04,834 INFO L87 Difference]: Start difference. First operand 236 states and 378 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-08 04:43:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:04,883 INFO L93 Difference]: Finished difference Result 242 states and 383 transitions. [2025-03-08 04:43:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:43:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 76 [2025-03-08 04:43:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:04,885 INFO L225 Difference]: With dead ends: 242 [2025-03-08 04:43:04,886 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 04:43:04,887 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-08 04:43:04,888 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:43:04,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 98 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:43:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 04:43:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-03-08 04:43:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 175 states have (on average 1.4914285714285713) internal successors, (261), 175 states have internal predecessors, (261), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 04:43:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 381 transitions. [2025-03-08 04:43:04,917 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 381 transitions. Word has length 76 [2025-03-08 04:43:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:04,918 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 381 transitions. [2025-03-08 04:43:04,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-08 04:43:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 381 transitions. [2025-03-08 04:43:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 04:43:04,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:43:04,923 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 04:43:04,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:43:04,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:43:04,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:43:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1834869520, now seen corresponding path program 2 times [2025-03-08 04:43:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:43:04,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-08 04:43:04,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:43:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:43:04,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 04:43:04,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 04:43:04,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:43:04,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-08 04:43:05,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:43:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-03-08 04:43:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:43:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744082266] [2025-03-08 04:43:05,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:43:05,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:43:05,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:43:05,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:43:05,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:43:05,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 04:43:05,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 04:43:05,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:43:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:43:05,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:43:05,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:43:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 04:43:05,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:43:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 04:43:05,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744082266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:43:05,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:43:05,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-08 04:43:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460572282] [2025-03-08 04:43:05,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:43:05,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 04:43:05,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:43:05,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 04:43:05,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:43:05,362 INFO L87 Difference]: Start difference. First operand 240 states and 381 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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-08 04:43:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:43:05,523 INFO L93 Difference]: Finished difference Result 728 states and 1203 transitions. [2025-03-08 04:43:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 04:43:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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 76 [2025-03-08 04:43:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:43:05,524 INFO L225 Difference]: With dead ends: 728 [2025-03-08 04:43:05,526 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:43:05,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 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-08 04:43:05,528 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:43:05,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 197 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:43:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:43:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:43:05,530 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-08 04:43:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:43:05,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2025-03-08 04:43:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:43:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:43:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 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-08 04:43:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:43:05,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:43:05,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:43:05,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:43:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:43:05,736 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-08 04:43:05,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:43:06,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:43:06,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:43:06 BoogieIcfgContainer [2025-03-08 04:43:06,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:43:06,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:43:06,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:43:06,357 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:43:06,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:43:03" (3/4) ... [2025-03-08 04:43:06,358 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:43:06,362 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 04:43:06,364 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 04:43:06,364 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 04:43:06,364 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:43:06,365 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:43:06,417 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:43:06,418 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:43:06,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:43:06,419 INFO L158 Benchmark]: Toolchain (without parser) took 3742.86ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 62.3MB in the end (delta: 45.4MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-03-08 04:43:06,419 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:43:06,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.74ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 96.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:43:06,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.62ms. Allocated memory is still 142.6MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:43:06,421 INFO L158 Benchmark]: Boogie Preprocessor took 17.38ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:43:06,421 INFO L158 Benchmark]: IcfgBuilder took 175.17ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 82.9MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:43:06,422 INFO L158 Benchmark]: TraceAbstraction took 3299.44ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 68.0MB in the end (delta: 14.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-03-08 04:43:06,422 INFO L158 Benchmark]: Witness Printer took 61.91ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 62.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:43:06,423 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.74ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 96.0MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.62ms. Allocated memory is still 142.6MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.38ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 175.17ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 82.9MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3299.44ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 68.0MB in the end (delta: 14.9MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Witness Printer took 61.91ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 62.3MB in the end (delta: 5.7MB). There was no memory consumed. 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, 23 locations, 36 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 734 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 534 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 200 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred 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.0s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1126/1286 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-08 04:43:06,438 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