./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/bh2017-ex-add.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:58:23,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:58:23,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:58:23,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:58:23,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:58:24,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:58:24,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:58:24,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:58:24,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:58:24,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:58:24,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:58:24,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:58:24,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:58:24,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:58:24,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:24,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:24,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:58:24,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:58:24,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:58:24,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:58:24,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:58:24,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:58:24,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:58:24,005 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9067bcd66b4865bfb6aa4fb5c23797c879c2b81c36d918479d6650dc5a4b5edc [2025-01-09 02:58:24,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:58:24,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:58:24,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:58:24,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:58:24,199 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:58:24,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-01-09 02:58:25,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c16cfc02/017669de28c647c3a67b9cc11f4f7563/FLAGf1d89e1e4 [2025-01-09 02:58:25,519 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:58:25,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i [2025-01-09 02:58:25,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c16cfc02/017669de28c647c3a67b9cc11f4f7563/FLAGf1d89e1e4 [2025-01-09 02:58:25,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c16cfc02/017669de28c647c3a67b9cc11f4f7563 [2025-01-09 02:58:25,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:58:25,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:58:25,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:58:25,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:58:25,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:58:25,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:25" (1/1) ... [2025-01-09 02:58:25,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d58ad50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:25, skipping insertion in model container [2025-01-09 02:58:25,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:25" (1/1) ... [2025-01-09 02:58:25,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:58:26,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i[802,815] [2025-01-09 02:58:26,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:58:26,031 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:58:26,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex-add.i[802,815] [2025-01-09 02:58:26,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:58:26,054 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:58:26,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26 WrapperNode [2025-01-09 02:58:26,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:58:26,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:58:26,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:58:26,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:58:26,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,072 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2025-01-09 02:58:26,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:58:26,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:58:26,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:58:26,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:58:26,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,090 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-01-09 02:58:26,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,092 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:58:26,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:58:26,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:58:26,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:58:26,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (1/1) ... [2025-01-09 02:58:26,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:26,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:58:26,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:58:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:58:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:58:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:58:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:58:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 02:58:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 02:58:26,187 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:58:26,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:58:26,287 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-09 02:58:26,287 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:58:26,292 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:58:26,293 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:58:26,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:26 BoogieIcfgContainer [2025-01-09 02:58:26,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:58:26,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:58:26,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:58:26,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:58:26,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:25" (1/3) ... [2025-01-09 02:58:26,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be14295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:26, skipping insertion in model container [2025-01-09 02:58:26,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:26" (2/3) ... [2025-01-09 02:58:26,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be14295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:26, skipping insertion in model container [2025-01-09 02:58:26,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:26" (3/3) ... [2025-01-09 02:58:26,299 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex-add.i [2025-01-09 02:58:26,309 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:58:26,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex-add.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:58:26,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:58:26,350 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;@4c834ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:58:26,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:58:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:58:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 02:58:26,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:26,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 02:58:26,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:26,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 891371642, now seen corresponding path program 1 times [2025-01-09 02:58:26,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:26,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919358827] [2025-01-09 02:58:26,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:26,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 02:58:26,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 02:58:26,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:26,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:26,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919358827] [2025-01-09 02:58:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919358827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:26,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:58:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443223461] [2025-01-09 02:58:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:58:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:26,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:58:26,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:58:26,530 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:26,572 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. [2025-01-09 02:58:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:26,573 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-01-09 02:58:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:26,577 INFO L225 Difference]: With dead ends: 49 [2025-01-09 02:58:26,577 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 02:58:26,579 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-01-09 02:58:26,581 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:26,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 02:58:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 02:58:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:58:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-01-09 02:58:26,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 6 [2025-01-09 02:58:26,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:26,602 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-01-09 02:58:26,602 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-01-09 02:58:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-01-09 02:58:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:58:26,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:26,602 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:26,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:58:26,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:26,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash -223525666, now seen corresponding path program 1 times [2025-01-09 02:58:26,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:26,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595277899] [2025-01-09 02:58:26,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:26,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:58:26,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:58:26,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:58:26,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:26,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595277899] [2025-01-09 02:58:26,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595277899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:26,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:26,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:58:26,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905322862] [2025-01-09 02:58:26,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:26,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:58:26,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:26,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:58:26,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:58:26,674 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:58:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:26,716 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-01-09 02:58:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:26,718 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-01-09 02:58:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:26,718 INFO L225 Difference]: With dead ends: 32 [2025-01-09 02:58:26,718 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 02:58:26,718 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-01-09 02:58:26,719 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:26,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 02:58:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 02:58:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:58:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-01-09 02:58:26,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 11 [2025-01-09 02:58:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-01-09 02:58:26,726 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-01-09 02:58:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-01-09 02:58:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:58:26,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:26,726 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:26,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:58:26,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:26,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1543906626, now seen corresponding path program 1 times [2025-01-09 02:58:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:26,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181333841] [2025-01-09 02:58:26,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:26,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:58:26,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:58:26,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:26,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:58:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:26,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181333841] [2025-01-09 02:58:26,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181333841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:26,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:26,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:58:26,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928652888] [2025-01-09 02:58:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:26,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:58:26,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:26,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:58:26,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:26,793 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:58:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:26,806 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2025-01-09 02:58:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:58:26,807 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-01-09 02:58:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:26,808 INFO L225 Difference]: With dead ends: 70 [2025-01-09 02:58:26,809 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 02:58:26,809 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-01-09 02:58:26,810 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:26,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 02:58:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 02:58:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 02:58:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2025-01-09 02:58:26,816 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 20 [2025-01-09 02:58:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:26,816 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2025-01-09 02:58:26,816 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-01-09 02:58:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2025-01-09 02:58:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:58:26,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:26,817 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:58:26,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1085588371, now seen corresponding path program 1 times [2025-01-09 02:58:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811177151] [2025-01-09 02:58:26,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:26,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:58:26,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:58:26,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:26,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 02:58:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:26,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811177151] [2025-01-09 02:58:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811177151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:26,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:58:26,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536185219] [2025-01-09 02:58:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:58:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:26,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:58:26,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:26,888 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:58:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:26,903 INFO L93 Difference]: Finished difference Result 104 states and 150 transitions. [2025-01-09 02:58:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:58:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 02:58:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:26,904 INFO L225 Difference]: With dead ends: 104 [2025-01-09 02:58:26,904 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 02:58:26,905 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-01-09 02:58:26,905 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:26,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 02:58:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 02:58:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 02:58:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-01-09 02:58:26,913 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 22 [2025-01-09 02:58:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:26,913 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-01-09 02:58:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:58:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-01-09 02:58:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:58:26,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:26,915 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:26,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:58:26,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:26,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1516019135, now seen corresponding path program 1 times [2025-01-09 02:58:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:26,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535156920] [2025-01-09 02:58:26,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:26,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:58:26,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:58:26,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:26,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:58:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535156920] [2025-01-09 02:58:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535156920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:27,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905396130] [2025-01-09 02:58:27,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:27,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:27,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:27,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:58:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:58:27,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:58:27,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:58:27,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:27,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:27,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:58:27,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:58:27,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:58:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905396130] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:27,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:58:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906601506] [2025-01-09 02:58:27,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:27,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:27,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:27,209 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:27,255 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-01-09 02:58:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:27,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 36 [2025-01-09 02:58:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:27,257 INFO L225 Difference]: With dead ends: 192 [2025-01-09 02:58:27,257 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 02:58:27,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:27,258 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:27,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 96 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 02:58:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 02:58:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 99 states have internal predecessors, (147), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 02:58:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2025-01-09 02:58:27,270 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 36 [2025-01-09 02:58:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:27,270 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2025-01-09 02:58:27,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2025-01-09 02:58:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:58:27,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:27,271 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:27,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 02:58:27,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:27,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:27,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 209453936, now seen corresponding path program 1 times [2025-01-09 02:58:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936029733] [2025-01-09 02:58:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:27,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:58:27,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:58:27,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:27,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:58:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936029733] [2025-01-09 02:58:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936029733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409155432] [2025-01-09 02:58:27,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:27,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:58:27,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:58:27,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:58:27,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:58:27,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:27,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:27,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:58:27,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:58:27,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 02:58:27,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409155432] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:27,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:27,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:58:27,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088717361] [2025-01-09 02:58:27,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:27,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:27,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:27,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:27,694 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:27,726 INFO L93 Difference]: Finished difference Result 414 states and 667 transitions. [2025-01-09 02:58:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2025-01-09 02:58:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:27,728 INFO L225 Difference]: With dead ends: 414 [2025-01-09 02:58:27,728 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 02:58:27,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:27,729 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:27,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 02:58:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-01-09 02:58:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.5) internal successors, (333), 222 states have internal predecessors, (333), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 02:58:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 453 transitions. [2025-01-09 02:58:27,766 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 453 transitions. Word has length 38 [2025-01-09 02:58:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:27,766 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 453 transitions. [2025-01-09 02:58:27,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 453 transitions. [2025-01-09 02:58:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 02:58:27,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:27,772 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:27,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:58:27,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:27,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:27,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1455920330, now seen corresponding path program 2 times [2025-01-09 02:58:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125369880] [2025-01-09 02:58:27,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:27,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-01-09 02:58:27,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 02:58:27,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:27,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-09 02:58:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125369880] [2025-01-09 02:58:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125369880] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:28,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294726304] [2025-01-09 02:58:28,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:28,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:28,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:28,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:58:28,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:58:28,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-01-09 02:58:28,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 02:58:28,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:28,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:28,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:58:28,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 02:58:28,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 20 proven. 72 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 02:58:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294726304] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:28,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 02:58:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235132028] [2025-01-09 02:58:28,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:28,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 02:58:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:28,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 02:58:28,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:58:28,453 INFO L87 Difference]: Start difference. First operand 286 states and 453 transitions. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 02:58:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:28,636 INFO L93 Difference]: Finished difference Result 884 states and 1441 transitions. [2025-01-09 02:58:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:58:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 84 [2025-01-09 02:58:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:28,639 INFO L225 Difference]: With dead ends: 884 [2025-01-09 02:58:28,640 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 02:58:28,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:58:28,641 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 199 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:28,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 274 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:58:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 02:58:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-09 02:58:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 470 states have (on average 1.504255319148936) internal successors, (707), 469 states have internal predecessors, (707), 126 states have call successors, (126), 4 states have call predecessors, (126), 3 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 02:58:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 959 transitions. [2025-01-09 02:58:28,669 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 959 transitions. Word has length 84 [2025-01-09 02:58:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 959 transitions. [2025-01-09 02:58:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 17 states have internal predecessors, (81), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 02:58:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 959 transitions. [2025-01-09 02:58:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 02:58:28,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:28,671 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:28,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:58:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:28,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2101978887, now seen corresponding path program 2 times [2025-01-09 02:58:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392790042] [2025-01-09 02:58:28,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:28,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-01-09 02:58:28,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 02:58:28,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-01-09 02:58:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392790042] [2025-01-09 02:58:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392790042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:58:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218808767] [2025-01-09 02:58:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:58:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:28,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:58:28,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:58:28,974 INFO L87 Difference]: Start difference. First operand 600 states and 959 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:58:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:29,036 INFO L93 Difference]: Finished difference Result 602 states and 960 transitions. [2025-01-09 02:58:29,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:29,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2025-01-09 02:58:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:29,038 INFO L225 Difference]: With dead ends: 602 [2025-01-09 02:58:29,038 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:58:29,038 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-01-09 02:58:29,039 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:29,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:58:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:58:29,039 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-01-09 02:58:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:58:29,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2025-01-09 02:58:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:29,040 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:58:29,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:58:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:58:29,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:58:29,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:58:29,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:58:29,044 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-01-09 02:58:29,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:58:29,706 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:58:29,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:58:29 BoogieIcfgContainer [2025-01-09 02:58:29,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:58:29,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:58:29,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:58:29,715 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:58:29,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:26" (3/4) ... [2025-01-09 02:58:29,717 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:58:29,721 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 02:58:29,723 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-09 02:58:29,724 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 02:58:29,724 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:58:29,724 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:58:29,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:58:29,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:58:29,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:58:29,777 INFO L158 Benchmark]: Toolchain (without parser) took 3879.83ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 105.5MB in the beginning and 77.9MB in the end (delta: 27.5MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2025-01-09 02:58:29,777 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:29,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.22ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:58:29,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.69ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:29,778 INFO L158 Benchmark]: Boogie Preprocessor took 22.76ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:29,778 INFO L158 Benchmark]: RCFGBuilder took 196.99ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 81.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:58:29,779 INFO L158 Benchmark]: TraceAbstraction took 3419.97ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 80.9MB in the beginning and 83.7MB in the end (delta: -2.8MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2025-01-09 02:58:29,779 INFO L158 Benchmark]: Witness Printer took 61.86ms. Allocated memory is still 184.5MB. Free memory was 83.7MB in the beginning and 77.9MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:29,780 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.20ms. Allocated memory is still 192.9MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.22ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.69ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.76ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 196.99ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 81.3MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3419.97ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 80.9MB in the beginning and 83.7MB in the end (delta: -2.8MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Witness Printer took 61.86ms. Allocated memory is still 184.5MB. Free memory was 83.7MB in the beginning and 77.9MB 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 869 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 639 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 230 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 605 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1158/1348 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2025-01-09 02:58:29,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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