./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-ex3.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 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:58:30,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:58:30,232 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:30,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:58:30,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:58:30,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:58:30,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:58:30,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:58:30,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:58:30,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:58:30,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:58:30,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:58:30,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:58:30,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:58:30,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:58:30,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:58:30,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:30,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:58:30,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:30,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:58:30,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:58:30,278 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 -> 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 [2025-01-09 02:58:30,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:58:30,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:58:30,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:58:30,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:58:30,575 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:58:30,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/bh2017-ex3.i [2025-01-09 02:58:31,861 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b35250c33/ad1efee1833a46a2a05715d4a9ea0030/FLAGc6d129203 [2025-01-09 02:58:32,159 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:58:32,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex3.i [2025-01-09 02:58:32,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b35250c33/ad1efee1833a46a2a05715d4a9ea0030/FLAGc6d129203 [2025-01-09 02:58:32,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b35250c33/ad1efee1833a46a2a05715d4a9ea0030 [2025-01-09 02:58:32,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:58:32,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:58:32,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:58:32,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:58:32,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:58:32,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:32" (1/1) ... [2025-01-09 02:58:32,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fcb2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32, skipping insertion in model container [2025-01-09 02:58:32,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:32" (1/1) ... [2025-01-09 02:58:32,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:58:32,346 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-ex3.i[799,812] [2025-01-09 02:58:32,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:58:32,372 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:58:32,382 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-ex3.i[799,812] [2025-01-09 02:58:32,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:58:32,400 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:58:32,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32 WrapperNode [2025-01-09 02:58:32,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:58:32,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:58:32,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:58:32,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:58:32,408 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:32" (1/1) ... [2025-01-09 02:58:32,413 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:32" (1/1) ... [2025-01-09 02:58:32,427 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2025-01-09 02:58:32,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:58:32,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:58:32,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:58:32,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:58:32,438 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:32" (1/1) ... [2025-01-09 02:58:32,438 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:32" (1/1) ... [2025-01-09 02:58:32,444 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:32" (1/1) ... [2025-01-09 02:58:32,456 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:32,456 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:32" (1/1) ... [2025-01-09 02:58:32,456 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:32" (1/1) ... [2025-01-09 02:58:32,458 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:32" (1/1) ... [2025-01-09 02:58:32,459 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:32" (1/1) ... [2025-01-09 02:58:32,461 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:32" (1/1) ... [2025-01-09 02:58:32,466 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:32" (1/1) ... [2025-01-09 02:58:32,467 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:32" (1/1) ... [2025-01-09 02:58:32,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:58:32,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:58:32,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:58:32,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:58:32,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 02:58:32,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:58:32,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:32,500 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:32,502 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:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:58:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:58:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:58:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:58:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 02:58:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 02:58:32,577 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:58:32,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:58:32,672 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-01-09 02:58:32,673 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:58:32,679 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:58:32,679 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:58:32,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:32 BoogieIcfgContainer [2025-01-09 02:58:32,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:58:32,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:58:32,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:58:32,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:58:32,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:32" (1/3) ... [2025-01-09 02:58:32,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cd8b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:32, skipping insertion in model container [2025-01-09 02:58:32,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (2/3) ... [2025-01-09 02:58:32,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cd8b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:32, skipping insertion in model container [2025-01-09 02:58:32,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:32" (3/3) ... [2025-01-09 02:58:32,691 INFO L128 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2025-01-09 02:58:32,705 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:58:32,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bh2017-ex3.i that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:58:32,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:58:32,769 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;@1028fb31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:58:32,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:58:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:58:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 02:58:32,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:32,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 02:58:32,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:32,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash 891125370, now seen corresponding path program 1 times [2025-01-09 02:58:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494228459] [2025-01-09 02:58:32,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:32,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:32,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 02:58:32,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 02:58:32,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:32,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:33,020 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:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494228459] [2025-01-09 02:58:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494228459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:33,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:33,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:58:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654189650] [2025-01-09 02:58:33,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:33,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:58:33,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:33,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:58:33,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:58:33,049 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:58:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:33,120 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2025-01-09 02:58:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:33,122 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:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:33,129 INFO L225 Difference]: With dead ends: 45 [2025-01-09 02:58:33,130 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 02:58:33,132 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:33,135 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:33,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 02:58:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 02:58:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:58:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-01-09 02:58:33,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 6 [2025-01-09 02:58:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:33,168 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-01-09 02:58:33,168 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:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-01-09 02:58:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:58:33,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:33,170 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:33,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:58:33,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:33,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1546864854, now seen corresponding path program 1 times [2025-01-09 02:58:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098370533] [2025-01-09 02:58:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:33,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:58:33,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:58:33,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:33,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:33,309 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:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098370533] [2025-01-09 02:58:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098370533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:33,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:58:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221347879] [2025-01-09 02:58:33,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:33,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:58:33,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:33,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:58:33,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:58:33,312 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:58:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:33,367 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-01-09 02:58:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:58:33,368 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:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:33,369 INFO L225 Difference]: With dead ends: 30 [2025-01-09 02:58:33,369 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 02:58:33,369 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:33,370 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:33,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 02:58:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 02:58:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:58:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-01-09 02:58:33,382 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2025-01-09 02:58:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:33,382 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-01-09 02:58:33,382 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:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-01-09 02:58:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:58:33,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:33,383 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:33,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:58:33,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:33,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 714202690, now seen corresponding path program 1 times [2025-01-09 02:58:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261141087] [2025-01-09 02:58:33,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:33,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:58:33,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:58:33,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:33,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:33,470 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:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261141087] [2025-01-09 02:58:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261141087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:33,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:33,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:58:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440462346] [2025-01-09 02:58:33,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:33,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:58:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:33,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:58:33,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:33,474 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:58:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:33,493 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2025-01-09 02:58:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:58:33,493 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:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:33,496 INFO L225 Difference]: With dead ends: 64 [2025-01-09 02:58:33,497 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 02:58:33,497 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:33,498 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:33,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 02:58:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 02:58:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 02:58:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-01-09 02:58:33,511 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 20 [2025-01-09 02:58:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:33,511 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-01-09 02:58:33,512 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:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-01-09 02:58:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:58:33,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:33,513 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:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:58:33,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1792705264, now seen corresponding path program 1 times [2025-01-09 02:58:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200138295] [2025-01-09 02:58:33,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:33,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:58:33,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:58:33,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:33,578 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:33,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200138295] [2025-01-09 02:58:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200138295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:33,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:33,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:58:33,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476766100] [2025-01-09 02:58:33,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:58:33,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:33,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:58:33,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:58:33,581 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 02:58:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:33,596 INFO L93 Difference]: Finished difference Result 92 states and 132 transitions. [2025-01-09 02:58:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:58:33,596 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:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:33,598 INFO L225 Difference]: With dead ends: 92 [2025-01-09 02:58:33,599 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 02:58:33,600 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:33,600 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:33,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 02:58:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 02:58:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 02:58:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-01-09 02:58:33,613 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 20 [2025-01-09 02:58:33,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:33,613 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-01-09 02:58:33,613 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:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-01-09 02:58:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:58:33,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:33,615 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:58:33,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:33,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2000860172, now seen corresponding path program 1 times [2025-01-09 02:58:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471838649] [2025-01-09 02:58:33,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:33,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:58:33,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:58:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:33,713 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:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471838649] [2025-01-09 02:58:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471838649] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922559037] [2025-01-09 02:58:33,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:33,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:33,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:33,718 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:33,719 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:33,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:58:33,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:58:33,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:33,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:33,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:58:33,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:33,852 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:33,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:33,927 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:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922559037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:33,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:58:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735351810] [2025-01-09 02:58:33,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:33,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:33,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:33,931 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:34,019 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2025-01-09 02:58:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 34 [2025-01-09 02:58:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:34,021 INFO L225 Difference]: With dead ends: 164 [2025-01-09 02:58:34,021 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 02:58:34,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:34,022 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 49 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:34,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:58:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 02:58:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 02:58:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 02:58:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2025-01-09 02:58:34,040 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 34 [2025-01-09 02:58:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:34,041 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2025-01-09 02:58:34,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2025-01-09 02:58:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:58:34,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:34,042 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:34,049 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:34,246 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:34,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:34,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2698474, now seen corresponding path program 1 times [2025-01-09 02:58:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70351987] [2025-01-09 02:58:34,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:34,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:58:34,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:58:34,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:34,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:34,321 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:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70351987] [2025-01-09 02:58:34,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70351987] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375563528] [2025-01-09 02:58:34,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:58:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:34,324 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:34,326 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:34,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:58:34,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:58:34,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:58:34,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 02:58:34,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:34,404 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:34,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:34,468 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:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375563528] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:34,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:34,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:58:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308396784] [2025-01-09 02:58:34,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:34,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:58:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:34,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:58:34,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:34,470 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:34,543 INFO L93 Difference]: Finished difference Result 344 states and 562 transitions. [2025-01-09 02:58:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 34 [2025-01-09 02:58:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:34,547 INFO L225 Difference]: With dead ends: 344 [2025-01-09 02:58:34,547 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 02:58:34,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:58:34,548 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:34,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 02:58:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 02:58:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.5) internal successors, (258), 172 states have internal predecessors, (258), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 02:58:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 378 transitions. [2025-01-09 02:58:34,588 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 378 transitions. Word has length 34 [2025-01-09 02:58:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:34,589 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 378 transitions. [2025-01-09 02:58:34,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 02:58:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 378 transitions. [2025-01-09 02:58:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 02:58:34,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:34,592 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:34,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:58:34,792 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:34,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2066858902, now seen corresponding path program 2 times [2025-01-09 02:58:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:34,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251836026] [2025-01-09 02:58:34,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:34,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:34,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 02:58:34,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 02:58:34,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:34,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-01-09 02:58:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251836026] [2025-01-09 02:58:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251836026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:58:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829462705] [2025-01-09 02:58:35,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:58:35,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:58:35,084 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:35,087 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:35,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 02:58:35,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 02:58:35,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:35,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:58:35,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:58:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 02:58:35,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:58:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 02:58:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829462705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:58:35,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:58:35,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 02:58:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990164688] [2025-01-09 02:58:35,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:58:35,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 02:58:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:35,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 02:58:35,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:58:35,422 INFO L87 Difference]: Start difference. First operand 236 states and 378 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 02:58:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:35,599 INFO L93 Difference]: Finished difference Result 724 states and 1201 transitions. [2025-01-09 02:58:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 02:58:35,599 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 76 [2025-01-09 02:58:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:35,604 INFO L225 Difference]: With dead ends: 724 [2025-01-09 02:58:35,604 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 02:58:35,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-09 02:58:35,606 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:35,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 191 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:58:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 02:58:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-01-09 02:58:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 360 states have (on average 1.5055555555555555) internal successors, (542), 359 states have internal predecessors, (542), 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:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 794 transitions. [2025-01-09 02:58:35,662 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 794 transitions. Word has length 76 [2025-01-09 02:58:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:35,662 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 794 transitions. [2025-01-09 02:58:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 14 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-01-09 02:58:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 794 transitions. [2025-01-09 02:58:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 02:58:35,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:58:35,665 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 02:58:35,675 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:35,869 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:35,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:58:35,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:58:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1004018552, now seen corresponding path program 2 times [2025-01-09 02:58:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:58:35,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804975681] [2025-01-09 02:58:35,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:58:35,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:58:35,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 02:58:35,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 02:58:35,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:58:35,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:58:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-09 02:58:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:58:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804975681] [2025-01-09 02:58:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804975681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:58:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:58:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:58:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951790783] [2025-01-09 02:58:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:58:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:58:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:58:36,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:58:36,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:58:36,031 INFO L87 Difference]: Start difference. First operand 490 states and 794 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:58:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:58:36,105 INFO L93 Difference]: Finished difference Result 492 states and 795 transitions. [2025-01-09 02:58:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:58:36,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2025-01-09 02:58:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:58:36,108 INFO L225 Difference]: With dead ends: 492 [2025-01-09 02:58:36,108 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:58:36,109 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:36,110 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:58:36,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:58:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:58:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:58:36,112 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:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:58:36,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2025-01-09 02:58:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:58:36,113 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:58:36,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:58:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:58:36,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:58:36,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:58:36,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:58:36,118 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-01-09 02:58:36,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:58:37,047 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:58:37,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:58:37 BoogieIcfgContainer [2025-01-09 02:58:37,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:58:37,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:58:37,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:58:37,061 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:58:37,062 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:32" (3/4) ... [2025-01-09 02:58:37,064 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:58:37,069 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 02:58:37,071 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-09 02:58:37,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 02:58:37,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:58:37,072 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:58:37,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:58:37,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:58:37,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:58:37,145 INFO L158 Benchmark]: Toolchain (without parser) took 4944.88ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 79.0MB in the end (delta: 43.9MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2025-01-09 02:58:37,146 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:37,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.88ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:58:37,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.60ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 110.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:37,147 INFO L158 Benchmark]: Boogie Preprocessor took 37.35ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:58:37,148 INFO L158 Benchmark]: RCFGBuilder took 211.57ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 99.3MB in the end (delta: 10.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:58:37,148 INFO L158 Benchmark]: TraceAbstraction took 4378.64ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 84.3MB in the end (delta: 14.3MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-01-09 02:58:37,148 INFO L158 Benchmark]: Witness Printer took 81.89ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 79.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:58:37,150 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.27ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.88ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.60ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 110.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.35ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 109.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 211.57ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 99.3MB in the end (delta: 10.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4378.64ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 84.3MB in the end (delta: 14.3MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Witness Printer took 81.89ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 79.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 199 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 1126/1286 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2025-01-09 02:58:37,169 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