./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c --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/nla-digbench-scaling/hard2_valuebound2.c -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 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:30:29,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:30:30,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:30:30,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:30:30,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:30:30,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:30:30,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:30:30,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:30:30,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:30:30,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:30:30,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:30:30,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:30:30,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:30:30,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:30:30,047 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:30:30,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:30:30,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:30:30,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:30:30,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:30:30,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:30:30,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:30:30,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:30:30,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:30:30,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:30:30,051 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 -> 39b9505d3a064a677b57bccb6de3a4c04e873275d34ee3c16e80371638b07149 [2025-01-09 03:30:30,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:30:30,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:30:30,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:30:30,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:30:30,305 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:30:30,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2025-01-09 03:30:31,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84f5854d3/f8b7e129b593467bbbbb9c0080b093b4/FLAGa524578ba [2025-01-09 03:30:31,736 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:30:31,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound2.c [2025-01-09 03:30:31,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84f5854d3/f8b7e129b593467bbbbb9c0080b093b4/FLAGa524578ba [2025-01-09 03:30:32,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84f5854d3/f8b7e129b593467bbbbb9c0080b093b4 [2025-01-09 03:30:32,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:30:32,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:30:32,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:30:32,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:30:32,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:30:32,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bab8108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32, skipping insertion in model container [2025-01-09 03:30:32,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:30:32,269 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/nla-digbench-scaling/hard2_valuebound2.c[526,539] [2025-01-09 03:30:32,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:30:32,284 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:30:32,290 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/nla-digbench-scaling/hard2_valuebound2.c[526,539] [2025-01-09 03:30:32,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:30:32,301 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:30:32,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32 WrapperNode [2025-01-09 03:30:32,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:30:32,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:30:32,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:30:32,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:30:32,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,319 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-01-09 03:30:32,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:30:32,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:30:32,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:30:32,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:30:32,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,346 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-01-09 03:30:32,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:30:32,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:30:32,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:30:32,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:30:32,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (1/1) ... [2025-01-09 03:30:32,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:30:32,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:32,398 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 03:30:32,407 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 03:30:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:30:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:30:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:30:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:30:32,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:30:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:30:32,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:30:32,474 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:30:32,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:30:32,560 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:30:32,560 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:30:32,565 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:30:32,565 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:30:32,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:30:32 BoogieIcfgContainer [2025-01-09 03:30:32,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:30:32,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:30:32,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:30:32,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:30:32,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:30:32" (1/3) ... [2025-01-09 03:30:32,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6407b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:30:32, skipping insertion in model container [2025-01-09 03:30:32,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:30:32" (2/3) ... [2025-01-09 03:30:32,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6407b624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:30:32, skipping insertion in model container [2025-01-09 03:30:32,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:30:32" (3/3) ... [2025-01-09 03:30:32,572 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2_valuebound2.c [2025-01-09 03:30:32,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:30:32,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2_valuebound2.c that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:30:32,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:30:32,635 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;@2563f1b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:30:32,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:30:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 03:30:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:30:32,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:32,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:32,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:32,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 120815774, now seen corresponding path program 1 times [2025-01-09 03:30:32,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097163456] [2025-01-09 03:30:32,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:32,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:30:32,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:30:32,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:32,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:32,805 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 03:30:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097163456] [2025-01-09 03:30:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097163456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:30:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:30:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:30:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166728890] [2025-01-09 03:30:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:32,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:30:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:32,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:30:32,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:30:32,840 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 03:30:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:32,850 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2025-01-09 03:30:32,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:30:32,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2025-01-09 03:30:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:32,856 INFO L225 Difference]: With dead ends: 45 [2025-01-09 03:30:32,856 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 03:30:32,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:30:32,860 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:32,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:30:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 03:30:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 03:30:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:30:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-01-09 03:30:32,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 8 [2025-01-09 03:30:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:32,890 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-01-09 03:30:32,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 03:30:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2025-01-09 03:30:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:30:32,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:32,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:32,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:30:32,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:32,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash 178074076, now seen corresponding path program 1 times [2025-01-09 03:30:32,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:32,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41620804] [2025-01-09 03:30:32,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:32,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:30:32,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:30:32,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:32,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:33,024 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 03:30:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41620804] [2025-01-09 03:30:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41620804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:30:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:30:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:30:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450207438] [2025-01-09 03:30:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:33,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:30:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:33,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:30:33,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:30:33,031 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 03:30:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:33,098 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-01-09 03:30:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:30:33,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-01-09 03:30:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:33,100 INFO L225 Difference]: With dead ends: 32 [2025-01-09 03:30:33,101 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 03:30:33,101 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 03:30:33,101 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:33,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:30:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 03:30:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-01-09 03:30:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:30:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-01-09 03:30:33,111 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 8 [2025-01-09 03:30:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:33,111 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-01-09 03:30:33,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 03:30:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-01-09 03:30:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 03:30:33,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:33,112 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:33,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:30:33,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash 953479797, now seen corresponding path program 1 times [2025-01-09 03:30:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:33,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871747812] [2025-01-09 03:30:33,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:33,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 03:30:33,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 03:30:33,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:33,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:33,193 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 03:30:33,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:33,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871747812] [2025-01-09 03:30:33,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871747812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:30:33,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:30:33,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:30:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330230980] [2025-01-09 03:30:33,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:33,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:30:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:33,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:30:33,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:30:33,196 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:30:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:33,243 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-01-09 03:30:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:30:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2025-01-09 03:30:33,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:33,244 INFO L225 Difference]: With dead ends: 36 [2025-01-09 03:30:33,244 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 03:30:33,245 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 03:30:33,245 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:33,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:30:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 03:30:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2025-01-09 03:30:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:30:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-01-09 03:30:33,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2025-01-09 03:30:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:33,251 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-01-09 03:30:33,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 03:30:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-01-09 03:30:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 03:30:33,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:33,251 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:33,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:30:33,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash -56114884, now seen corresponding path program 1 times [2025-01-09 03:30:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97752844] [2025-01-09 03:30:33,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:33,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:33,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 03:30:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 03:30:33,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:33,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:33,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027145924] [2025-01-09 03:30:33,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:33,277 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 03:30:33,279 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 03:30:33,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 03:30:33,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 03:30:33,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:33,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 03:30:33,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:33,423 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 03:30:33,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:30:33,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97752844] [2025-01-09 03:30:33,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027145924] [2025-01-09 03:30:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027145924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:30:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:30:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:30:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593851832] [2025-01-09 03:30:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:33,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:30:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:33,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:30:33,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:30:33,429 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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 03:30:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:33,490 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2025-01-09 03:30:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:30:33,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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 18 [2025-01-09 03:30:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:33,491 INFO L225 Difference]: With dead ends: 51 [2025-01-09 03:30:33,491 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 03:30:33,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 03:30:33,493 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:33,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 81 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:30:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 03:30:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 03:30:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:30:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2025-01-09 03:30:33,505 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 18 [2025-01-09 03:30:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:33,505 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2025-01-09 03:30:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 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 03:30:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2025-01-09 03:30:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 03:30:33,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:33,507 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:33,514 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 03:30:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:33,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:33,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash 440402527, now seen corresponding path program 1 times [2025-01-09 03:30:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112104750] [2025-01-09 03:30:33,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:33,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:30:33,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:30:33,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:33,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314315668] [2025-01-09 03:30:33,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:33,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:33,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:33,734 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 03:30:33,737 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 03:30:33,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 03:30:33,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 03:30:33,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:33,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:33,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 03:30:33,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:30:33,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:30:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112104750] [2025-01-09 03:30:33,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314315668] [2025-01-09 03:30:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314315668] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:33,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:30:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-01-09 03:30:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284757695] [2025-01-09 03:30:33,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:33,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:30:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:33,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:30:33,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:30:33,972 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:30:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:34,045 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-01-09 03:30:34,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:30:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 24 [2025-01-09 03:30:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:34,046 INFO L225 Difference]: With dead ends: 51 [2025-01-09 03:30:34,046 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 03:30:34,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:30:34,047 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:34,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:30:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 03:30:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-01-09 03:30:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:30:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2025-01-09 03:30:34,053 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 24 [2025-01-09 03:30:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:34,053 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-01-09 03:30:34,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:30:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2025-01-09 03:30:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 03:30:34,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:34,053 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:34,060 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 03:30:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:34,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -728619833, now seen corresponding path program 1 times [2025-01-09 03:30:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283538453] [2025-01-09 03:30:34,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:34,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 03:30:34,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 03:30:34,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178315827] [2025-01-09 03:30:34,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:34,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:34,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:34,283 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 03:30:34,283 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 03:30:34,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 03:30:34,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 03:30:34,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:34,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:34,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:30:34,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:30:34,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:30:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283538453] [2025-01-09 03:30:34,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178315827] [2025-01-09 03:30:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178315827] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 03:30:34,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:30:34,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 03:30:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363109032] [2025-01-09 03:30:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:34,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:30:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:34,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:30:34,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:30:34,457 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:30:35,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:30:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:35,528 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2025-01-09 03:30:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:30:35,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-01-09 03:30:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:35,530 INFO L225 Difference]: With dead ends: 57 [2025-01-09 03:30:35,530 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 03:30:35,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:30:35,531 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:35,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:30:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 03:30:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-01-09 03:30:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:30:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-01-09 03:30:35,540 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 34 [2025-01-09 03:30:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-01-09 03:30:35,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:30:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-01-09 03:30:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 03:30:35,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:35,541 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:35,549 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 03:30:35,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:35,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:35,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash -821206152, now seen corresponding path program 1 times [2025-01-09 03:30:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:35,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009551712] [2025-01-09 03:30:35,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:35,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 03:30:35,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 03:30:35,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:35,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 03:30:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009551712] [2025-01-09 03:30:35,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009551712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:30:35,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:30:35,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:30:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253266093] [2025-01-09 03:30:35,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:35,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:30:35,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:35,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:30:35,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:30:35,890 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 03:30:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:35,945 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2025-01-09 03:30:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:30:35,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2025-01-09 03:30:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:35,946 INFO L225 Difference]: With dead ends: 62 [2025-01-09 03:30:35,947 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 03:30:35,947 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 03:30:35,948 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:35,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 91 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:30:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 03:30:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 03:30:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:30:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-01-09 03:30:35,961 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 40 [2025-01-09 03:30:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:35,962 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-01-09 03:30:35,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 03:30:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-01-09 03:30:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 03:30:35,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:35,963 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:35,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:30:35,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:35,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:35,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1422038353, now seen corresponding path program 1 times [2025-01-09 03:30:35,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:35,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259705011] [2025-01-09 03:30:35,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:35,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:35,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 03:30:35,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 03:30:35,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:35,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:35,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537526042] [2025-01-09 03:30:35,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:35,993 INFO L229 MonitoredProcess]: Starting monitored process 5 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 03:30:35,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:30:36,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 03:30:36,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 03:30:36,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:36,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:36,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 03:30:36,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 03:30:36,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 03:30:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259705011] [2025-01-09 03:30:37,095 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537526042] [2025-01-09 03:30:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537526042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:37,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:30:37,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-01-09 03:30:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727417970] [2025-01-09 03:30:37,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:37,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 03:30:37,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:37,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 03:30:37,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:30:37,097 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-01-09 03:30:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:37,600 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2025-01-09 03:30:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:30:37,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 52 [2025-01-09 03:30:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:37,602 INFO L225 Difference]: With dead ends: 116 [2025-01-09 03:30:37,602 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 03:30:37,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:30:37,603 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:37,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:30:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 03:30:37,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-01-09 03:30:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 56 states have internal predecessors, (65), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 03:30:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-01-09 03:30:37,637 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 52 [2025-01-09 03:30:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:37,638 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-01-09 03:30:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 14 states have internal predecessors, (26), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2025-01-09 03:30:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2025-01-09 03:30:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 03:30:37,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:37,639 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:37,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:30:37,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 03:30:37,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:37,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1807358855, now seen corresponding path program 1 times [2025-01-09 03:30:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331686056] [2025-01-09 03:30:37,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:37,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 03:30:37,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 03:30:37,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:37,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:37,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716078982] [2025-01-09 03:30:37,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:37,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:37,865 INFO L229 MonitoredProcess]: Starting monitored process 6 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 03:30:37,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:30:37,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 03:30:37,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 03:30:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:37,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 03:30:37,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 03:30:38,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 03:30:38,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:38,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331686056] [2025-01-09 03:30:38,442 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:38,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716078982] [2025-01-09 03:30:38,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716078982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:38,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:30:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-01-09 03:30:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757034868] [2025-01-09 03:30:38,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:38,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 03:30:38,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:38,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 03:30:38,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:30:38,444 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-01-09 03:30:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:38,789 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2025-01-09 03:30:38,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 03:30:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 63 [2025-01-09 03:30:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:38,794 INFO L225 Difference]: With dead ends: 142 [2025-01-09 03:30:38,794 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 03:30:38,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:30:38,795 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:38,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 155 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:30:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 03:30:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 91. [2025-01-09 03:30:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 56 states have internal predecessors, (62), 28 states have call successors, (28), 11 states have call predecessors, (28), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 03:30:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2025-01-09 03:30:38,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 63 [2025-01-09 03:30:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:38,836 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2025-01-09 03:30:38,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-01-09 03:30:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2025-01-09 03:30:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 03:30:38,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:38,837 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:38,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:30:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:39,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:39,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -423636374, now seen corresponding path program 1 times [2025-01-09 03:30:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111862059] [2025-01-09 03:30:39,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:39,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:30:39,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:30:39,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:39,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:30:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:39,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111862059] [2025-01-09 03:30:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111862059] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:30:39,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479958931] [2025-01-09 03:30:39,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:39,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:39,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:39,468 INFO L229 MonitoredProcess]: Starting monitored process 7 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 03:30:39,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:30:39,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 03:30:39,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 03:30:39,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:39,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:39,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 03:30:39,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:30:39,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:30:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479958931] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:39,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:30:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-01-09 03:30:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561409736] [2025-01-09 03:30:39,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:39,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:30:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:39,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:30:39,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:30:39,882 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-01-09 03:30:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:40,035 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2025-01-09 03:30:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:30:40,036 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 68 [2025-01-09 03:30:40,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:40,036 INFO L225 Difference]: With dead ends: 110 [2025-01-09 03:30:40,036 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 03:30:40,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:30:40,037 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:40,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:30:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 03:30:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 03:30:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 52 states have internal predecessors, (56), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 03:30:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2025-01-09 03:30:40,048 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 68 [2025-01-09 03:30:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:40,048 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2025-01-09 03:30:40,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2025-01-09 03:30:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2025-01-09 03:30:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:30:40,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:40,049 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:40,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:30:40,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:30:40,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1583120701, now seen corresponding path program 2 times [2025-01-09 03:30:40,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:40,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509042133] [2025-01-09 03:30:40,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:30:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:40,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-09 03:30:40,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:30:40,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:30:40,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 03:30:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509042133] [2025-01-09 03:30:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509042133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:30:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375778845] [2025-01-09 03:30:40,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:30:40,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:40,584 INFO L229 MonitoredProcess]: Starting monitored process 8 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 03:30:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:30:40,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-09 03:30:40,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:30:40,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:30:40,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:40,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 03:30:40,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 03:30:40,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 03:30:41,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375778845] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:41,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:30:41,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2025-01-09 03:30:41,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515153295] [2025-01-09 03:30:41,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:41,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 03:30:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:41,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 03:30:41,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:30:41,371 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 13 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2025-01-09 03:30:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:41,638 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2025-01-09 03:30:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:30:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 13 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 80 [2025-01-09 03:30:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:41,639 INFO L225 Difference]: With dead ends: 144 [2025-01-09 03:30:41,639 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 03:30:41,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2025-01-09 03:30:41,640 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:41,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 201 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:30:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 03:30:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-01-09 03:30:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 03:30:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2025-01-09 03:30:41,676 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 80 [2025-01-09 03:30:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:41,676 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2025-01-09 03:30:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 13 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2025-01-09 03:30:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2025-01-09 03:30:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:30:41,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:41,677 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:41,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:30:41,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:41,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1123498693, now seen corresponding path program 1 times [2025-01-09 03:30:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622380116] [2025-01-09 03:30:41,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:41,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:41,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:30:41,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:30:41,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:41,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 35 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-09 03:30:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622380116] [2025-01-09 03:30:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622380116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:30:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925557969] [2025-01-09 03:30:41,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:41,984 INFO L229 MonitoredProcess]: Starting monitored process 9 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 03:30:41,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:30:42,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:30:42,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:30:42,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:42,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:30:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 03:30:42,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:30:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925557969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:30:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:30:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-01-09 03:30:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040835217] [2025-01-09 03:30:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:30:42,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:30:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:42,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:30:42,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:30:42,118 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:30:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:42,169 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2025-01-09 03:30:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:30:42,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 80 [2025-01-09 03:30:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:42,170 INFO L225 Difference]: With dead ends: 102 [2025-01-09 03:30:42,170 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 03:30:42,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:30:42,171 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:42,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:30:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 03:30:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 03:30:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:30:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2025-01-09 03:30:42,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 80 [2025-01-09 03:30:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:42,179 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2025-01-09 03:30:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:30:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2025-01-09 03:30:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 03:30:42,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:42,180 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:42,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 03:30:42,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:42,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:42,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash 955762540, now seen corresponding path program 2 times [2025-01-09 03:30:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727491316] [2025-01-09 03:30:42,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:30:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:42,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-01-09 03:30:42,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:30:42,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:30:42,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420219877] [2025-01-09 03:30:42,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:30:42,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:42,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:42,399 INFO L229 MonitoredProcess]: Starting monitored process 10 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 03:30:42,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:30:42,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-01-09 03:30:42,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 03:30:42,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:30:42,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:42,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 03:30:42,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 48 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 03:30:42,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 48 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 03:30:49,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727491316] [2025-01-09 03:30:49,154 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420219877] [2025-01-09 03:30:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420219877] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:49,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:30:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2025-01-09 03:30:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507514136] [2025-01-09 03:30:49,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:49,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 03:30:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:49,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 03:30:49,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:30:49,156 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) [2025-01-09 03:30:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:49,348 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2025-01-09 03:30:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:30:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) Word has length 85 [2025-01-09 03:30:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:49,349 INFO L225 Difference]: With dead ends: 81 [2025-01-09 03:30:49,349 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 03:30:49,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 03:30:49,350 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:49,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:30:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 03:30:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 03:30:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:30:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2025-01-09 03:30:49,358 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 85 [2025-01-09 03:30:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2025-01-09 03:30:49,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 12 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (28), 12 states have call predecessors, (28), 12 states have call successors, (28) [2025-01-09 03:30:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2025-01-09 03:30:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 03:30:49,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:49,359 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:49,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 03:30:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:49,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:49,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 849146515, now seen corresponding path program 1 times [2025-01-09 03:30:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652023382] [2025-01-09 03:30:49,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:49,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:30:49,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:30:49,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:49,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:30:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476701106] [2025-01-09 03:30:49,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:49,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:49,580 INFO L229 MonitoredProcess]: Starting monitored process 11 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 03:30:49,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 03:30:49,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:30:49,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:30:49,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:49,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 03:30:49,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 03:30:49,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:50,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652023382] [2025-01-09 03:30:50,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:30:50,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476701106] [2025-01-09 03:30:50,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476701106] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:30:50,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:30:50,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-01-09 03:30:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571033211] [2025-01-09 03:30:50,312 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:50,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:30:50,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:50,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:30:50,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:30:50,313 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 03:30:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:50,483 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2025-01-09 03:30:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:30:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 91 [2025-01-09 03:30:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:50,485 INFO L225 Difference]: With dead ends: 85 [2025-01-09 03:30:50,485 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 03:30:50,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 03:30:50,485 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:50,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:30:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 03:30:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 03:30:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.0) internal successors, (51), 51 states have internal predecessors, (51), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 03:30:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-01-09 03:30:50,507 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 91 [2025-01-09 03:30:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:50,507 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-01-09 03:30:50,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 03:30:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-01-09 03:30:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:30:50,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:30:50,508 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:50,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 03:30:50,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 03:30:50,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:30:50,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:30:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash 327516894, now seen corresponding path program 1 times [2025-01-09 03:30:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:30:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787579018] [2025-01-09 03:30:50,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:50,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:30:50,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:30:50,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:30:50,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:50,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 03:30:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:30:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787579018] [2025-01-09 03:30:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787579018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:30:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933696739] [2025-01-09 03:30:50,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:30:50,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:30:50,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:30:50,978 INFO L229 MonitoredProcess]: Starting monitored process 12 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 03:30:50,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 03:30:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:30:51,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:30:51,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:30:51,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:30:51,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 03:30:51,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:30:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 34 proven. 65 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 03:30:51,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:30:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 34 proven. 65 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 03:30:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933696739] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:30:52,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:30:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 14] total 30 [2025-01-09 03:30:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598936501] [2025-01-09 03:30:52,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:30:52,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 03:30:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:30:52,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 03:30:52,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2025-01-09 03:30:52,555 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2025-01-09 03:30:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:30:52,781 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2025-01-09 03:30:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:30:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) Word has length 96 [2025-01-09 03:30:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:30:52,782 INFO L225 Difference]: With dead ends: 85 [2025-01-09 03:30:52,782 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 03:30:52,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 03:30:52,783 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:30:52,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 296 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:30:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 03:30:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 03:30:52,783 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 03:30:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 03:30:52,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2025-01-09 03:30:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:30:52,784 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 03:30:52,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2025-01-09 03:30:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 03:30:52,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 03:30:52,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:30:52,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 03:30:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 03:30:52,995 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:30:53,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 03:30:53,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:30:53,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:30:53 BoogieIcfgContainer [2025-01-09 03:30:53,424 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:30:53,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:30:53,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:30:53,425 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:30:53,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:30:32" (3/4) ... [2025-01-09 03:30:53,427 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 03:30:53,431 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-09 03:30:53,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 03:30:53,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 03:30:53,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 03:30:53,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 03:30:53,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 03:30:53,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:30:53,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:30:53,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:30:53,495 INFO L158 Benchmark]: Toolchain (without parser) took 21401.10ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 132.7MB in the beginning and 334.8MB in the end (delta: -202.0MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2025-01-09 03:30:53,495 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:30:53,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.07ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 121.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:30:53,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.59ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 120.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:30:53,495 INFO L158 Benchmark]: Boogie Preprocessor took 38.35ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:30:53,495 INFO L158 Benchmark]: RCFGBuilder took 207.84ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 107.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:30:53,496 INFO L158 Benchmark]: TraceAbstraction took 20856.83ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 106.3MB in the beginning and 342.9MB in the end (delta: -236.5MB). Peak memory consumption was 217.5MB. Max. memory is 16.1GB. [2025-01-09 03:30:53,496 INFO L158 Benchmark]: Witness Printer took 69.26ms. Allocated memory is still 427.8MB. Free memory was 342.9MB in the beginning and 334.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:30:53,499 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.07ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 121.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.59ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 120.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.35ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 207.84ms. Allocated memory is still 167.8MB. Free memory was 118.8MB in the beginning and 107.2MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20856.83ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 106.3MB in the beginning and 342.9MB in the end (delta: -236.5MB). Peak memory consumption was 217.5MB. Max. memory is 16.1GB. * Witness Printer took 69.26ms. Allocated memory is still 427.8MB. Free memory was 342.9MB in the beginning and 334.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 15, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 1958 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1571 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2115 IncrementalHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 387 mSDtfsCounter, 2115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1286 GetRequests, 1093 SyntacticMatches, 8 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=8, InterpolantAutomatonStates: 126, 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, 15 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1451 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1559 ConstructedInterpolants, 0 QuantifiedInterpolants, 14669 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 5837/6329 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: 44]: Loop Invariant Derived loop invariant: ((((((((((d == 1) && (p == 1)) && (q == 1)) && (((long long) r + 1) == A)) && (B == 1)) || (((((d == 1) && (p == 1)) && (q == 0)) && (A == r)) && (B == 1))) || (((((2 == p) && (q == 0)) && (A == r)) && (B == 1)) && (2 == d))) || ((((((2 == A) && (2 == p)) && (r == 0)) && (2 == q)) && (B == 1)) && (2 == d))) || ((((((d == 1) && (p == 1)) && (2 == A)) && (r == 0)) && (2 == q)) && (B == 1))) || ((((((p == 4) && (2 == A)) && (q == 0)) && (d == 4)) && (2 == r)) && (B == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((2 == p) && (q == 0)) && (A <= 2)) && (A == r)) && (1 <= r)) && (B == 1)) && (2 == d)) || (((((((d == 1) && (p == 1)) && (q == 0)) && (A <= 2)) && (A == r)) && (B == 1)) && (0 <= A))) || ((((((p == 4) && (2 == A)) && (q == 0)) && (d == 4)) && (2 == r)) && (B == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-09 03:30:53,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE