./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.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/hard-u_unwindbound20.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 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:28:38,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:28:38,791 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:28:38,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:28:38,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:28:38,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:28:38,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:28:38,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:28:38,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:28:38,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:28:38,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:28:38,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:28:38,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:28:38,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:28:38,823 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:28:38,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:28:38,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:28:38,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:28:38,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:28:38,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:28:38,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:28:38,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:28:38,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:28:38,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:28:38,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:28:38,826 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 -> 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 [2025-01-09 03:28:39,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:28:39,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:28:39,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:28:39,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:28:39,064 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:28:39,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2025-01-09 03:28:40,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82f92aa38/9a7445956c604a45be4817cc3ccfb9ca/FLAGc38887429 [2025-01-09 03:28:40,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:28:40,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2025-01-09 03:28:40,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82f92aa38/9a7445956c604a45be4817cc3ccfb9ca/FLAGc38887429 [2025-01-09 03:28:40,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82f92aa38/9a7445956c604a45be4817cc3ccfb9ca [2025-01-09 03:28:40,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:28:40,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:28:40,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:28:40,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:28:40,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:28:40,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40, skipping insertion in model container [2025-01-09 03:28:40,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:28:40,567 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/hard-u_unwindbound20.c[537,550] [2025-01-09 03:28:40,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:28:40,589 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:28:40,596 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/hard-u_unwindbound20.c[537,550] [2025-01-09 03:28:40,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:28:40,614 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:28:40,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40 WrapperNode [2025-01-09 03:28:40,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:28:40,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:28:40,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:28:40,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:28:40,621 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:28:40" (1/1) ... [2025-01-09 03:28:40,624 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:28:40" (1/1) ... [2025-01-09 03:28:40,636 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-01-09 03:28:40,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:28:40,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:28:40,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:28:40,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:28:40,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:28:40,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:28:40,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:28:40,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:28:40,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:28:40,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 03:28:40,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:28:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:40,692 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:28:40,703 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:28:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:28:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:28:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:28:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:28:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:28:40,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:28:40,761 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:28:40,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:28:40,857 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:28:40,857 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:28:40,864 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:28:40,864 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:28:40,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:40 BoogieIcfgContainer [2025-01-09 03:28:40,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:28:40,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:28:40,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:28:40,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:28:40,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:28:40" (1/3) ... [2025-01-09 03:28:40,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d365edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:28:40, skipping insertion in model container [2025-01-09 03:28:40,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (2/3) ... [2025-01-09 03:28:40,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d365edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:28:40, skipping insertion in model container [2025-01-09 03:28:40,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:40" (3/3) ... [2025-01-09 03:28:40,871 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.c [2025-01-09 03:28:40,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:28:40,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound20.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:28:40,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:28:40,921 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;@209d16f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:28:40,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:28:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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:28:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:28:40,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:40,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:40,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2025-01-09 03:28:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:40,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751093405] [2025-01-09 03:28:40,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:40,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:28:40,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:28:40,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:40,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:28:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751093405] [2025-01-09 03:28:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751093405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:28:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:28:41,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:28:41,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105858979] [2025-01-09 03:28:41,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:28:41,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:28:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:41,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:28:41,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:28:41,038 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:28:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:41,048 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2025-01-09 03:28:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:28:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2025-01-09 03:28:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:41,053 INFO L225 Difference]: With dead ends: 53 [2025-01-09 03:28:41,053 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 03:28:41,055 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:28:41,057 INFO L435 NwaCegarLoop]: 38 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, 38 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:28:41,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:28:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 03:28:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 03:28:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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:28:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-01-09 03:28:41,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2025-01-09 03:28:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:41,078 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-01-09 03:28:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:28:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-01-09 03:28:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:28:41,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:41,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:41,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:28:41,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:41,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2015332289, now seen corresponding path program 1 times [2025-01-09 03:28:41,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:41,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106483377] [2025-01-09 03:28:41,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:41,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:41,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:28:41,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:28:41,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:41,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:41,251 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:28:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106483377] [2025-01-09 03:28:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106483377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:28:41,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:28:41,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:28:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392116840] [2025-01-09 03:28:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:28:41,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:28:41,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:41,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:28:41,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:28:41,255 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:28:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:41,316 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-01-09 03:28:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:28:41,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-01-09 03:28:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:41,317 INFO L225 Difference]: With dead ends: 38 [2025-01-09 03:28:41,317 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 03:28:41,317 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:28:41,318 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 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:28:41,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:28:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 03:28:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-01-09 03:28:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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:28:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-09 03:28:41,324 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-01-09 03:28:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:41,324 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-09 03:28:41,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:28:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-09 03:28:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:28:41,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:41,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:41,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:28:41,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:41,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:41,325 INFO L85 PathProgramCache]: Analyzing trace with hash 902164894, now seen corresponding path program 1 times [2025-01-09 03:28:41,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:41,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725046846] [2025-01-09 03:28:41,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:41,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:41,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:28:41,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:28:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:41,390 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:28:41,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725046846] [2025-01-09 03:28:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725046846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:28:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:28:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:28:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109311763] [2025-01-09 03:28:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:28:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:28:41,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:41,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:28:41,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:28:41,391 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:28:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:41,414 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-01-09 03:28:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:28:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-01-09 03:28:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:41,417 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:28:41,417 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 03:28:41,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:28:41,418 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:41,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:28:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 03:28:41,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 03:28:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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:28:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-01-09 03:28:41,427 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2025-01-09 03:28:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:41,428 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-01-09 03:28:41,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:28:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-01-09 03:28:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:28:41,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:41,428 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:28:41,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1435955584, now seen corresponding path program 1 times [2025-01-09 03:28:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300993855] [2025-01-09 03:28:41,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:41,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:28:41,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:28:41,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:41,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:41,565 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:28:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300993855] [2025-01-09 03:28:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300993855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:28:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:28:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:28:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907670342] [2025-01-09 03:28:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:28:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:28:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:41,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:28:41,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:28:41,568 INFO L87 Difference]: Start difference. First operand 30 states and 39 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, (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:28:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:41,619 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-01-09 03:28:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:28:41,620 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, (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 15 [2025-01-09 03:28:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:41,621 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:28:41,621 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 03:28:41,621 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:28:41,621 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 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:28:41,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:28:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 03:28:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-01-09 03:28:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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:28:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-01-09 03:28:41,627 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2025-01-09 03:28:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:41,627 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-01-09 03:28:41,627 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, (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:28:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-01-09 03:28:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:28:41,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:41,628 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:28:41,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1121341599, now seen corresponding path program 1 times [2025-01-09 03:28:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7764257] [2025-01-09 03:28:41,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:41,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:41,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:28:41,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:28:41,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:41,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:28:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317172286] [2025-01-09 03:28:41,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:41,675 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:28:41,676 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:28:41,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:28:41,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:28:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:41,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:41,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 03:28:41,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:41,874 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:28:41,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:28:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7764257] [2025-01-09 03:28:41,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:28:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317172286] [2025-01-09 03:28:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317172286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:28:41,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:28:41,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:28:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531730735] [2025-01-09 03:28:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:28:41,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:28:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:41,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:28:41,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:28:41,877 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:28:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:42,021 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-01-09 03:28:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:28:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 20 [2025-01-09 03:28:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:42,022 INFO L225 Difference]: With dead ends: 63 [2025-01-09 03:28:42,022 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 03:28:42,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:28:42,023 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:42,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:28:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 03:28:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 03:28:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:28:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-01-09 03:28:42,030 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-01-09 03:28:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:42,030 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-01-09 03:28:42,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:28:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-01-09 03:28:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 03:28:42,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:42,031 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:42,043 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:28:42,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:42,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:42,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1012149342, now seen corresponding path program 1 times [2025-01-09 03:28:42,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:42,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708554308] [2025-01-09 03:28:42,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:42,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:28:42,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:28:42,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:42,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:28:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998669865] [2025-01-09 03:28:42,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:42,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:42,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:42,265 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:28:42,267 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:28:42,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:28:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:28:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:42,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 03:28:42,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:28:42,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:28:42,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708554308] [2025-01-09 03:28:42,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:28:42,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998669865] [2025-01-09 03:28:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998669865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:28:42,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:28:42,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-01-09 03:28:42,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340143135] [2025-01-09 03:28:42,807 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 03:28:42,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:28:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:42,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:28:42,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:28:42,808 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 03:28:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:43,090 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-01-09 03:28:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:28:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-01-09 03:28:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:43,092 INFO L225 Difference]: With dead ends: 64 [2025-01-09 03:28:43,092 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 03:28:43,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:28:43,092 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:43,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:28:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 03:28:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 03:28:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:28:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-01-09 03:28:43,103 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 28 [2025-01-09 03:28:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:43,103 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-01-09 03:28:43,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 03:28:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-01-09 03:28:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 03:28:43,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:43,104 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:43,113 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:28:43,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:43,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:43,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2060763589, now seen corresponding path program 1 times [2025-01-09 03:28:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357397192] [2025-01-09 03:28:43,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 03:28:43,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 03:28:43,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:43,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:28:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357397192] [2025-01-09 03:28:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357397192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:28:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584425143] [2025-01-09 03:28:43,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:43,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:43,362 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:28:43,364 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:28:43,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 03:28:43,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 03:28:43,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:43,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:43,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:28:43,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:28:43,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:28:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:28:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584425143] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:28:43,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:28:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-01-09 03:28:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721968175] [2025-01-09 03:28:43,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:28:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:28:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:43,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:28:43,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:28:43,481 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:28:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:43,575 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-01-09 03:28:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:28:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 30 [2025-01-09 03:28:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:43,577 INFO L225 Difference]: With dead ends: 115 [2025-01-09 03:28:43,577 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 03:28:43,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:28:43,578 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:43,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:28:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 03:28:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-01-09 03:28:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 03:28:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2025-01-09 03:28:43,598 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 30 [2025-01-09 03:28:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:43,599 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-01-09 03:28:43,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:28:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2025-01-09 03:28:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 03:28:43,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:43,602 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:43,618 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:28:43,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:43,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:43,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash -897447482, now seen corresponding path program 1 times [2025-01-09 03:28:43,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:43,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509586622] [2025-01-09 03:28:43,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:43,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 03:28:43,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 03:28:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:28:43,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817918826] [2025-01-09 03:28:43,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:43,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:43,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:43,830 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:28:43,834 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:28:43,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 03:28:43,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 03:28:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:43,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:43,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:28:43,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:28:43,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:28:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:28:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509586622] [2025-01-09 03:28:44,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:28:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817918826] [2025-01-09 03:28:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817918826] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 03:28:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:28:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-09 03:28:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365359354] [2025-01-09 03:28:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:28:44,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:28:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:44,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:28:44,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:28:44,075 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:28:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:44,372 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2025-01-09 03:28:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:28:44,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-01-09 03:28:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:44,374 INFO L225 Difference]: With dead ends: 114 [2025-01-09 03:28:44,374 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 03:28:44,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:28:44,375 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:28:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 03:28:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2025-01-09 03:28:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 73 states have internal predecessors, (82), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 03:28:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2025-01-09 03:28:44,387 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 38 [2025-01-09 03:28:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:44,388 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2025-01-09 03:28:44,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:28:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2025-01-09 03:28:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 03:28:44,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:44,390 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:44,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:28:44,590 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:28:44,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:44,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -207368571, now seen corresponding path program 1 times [2025-01-09 03:28:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370203438] [2025-01-09 03:28:44,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:44,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 03:28:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 03:28:44,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:44,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:28:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730985960] [2025-01-09 03:28:44,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:44,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:44,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:44,621 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:28:44,626 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:28:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 03:28:44,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 03:28:44,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:44,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:44,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 03:28:44,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:28:45,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:28:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:28:50,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370203438] [2025-01-09 03:28:50,309 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:28:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730985960] [2025-01-09 03:28:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730985960] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:28:50,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:28:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2025-01-09 03:28:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091138016] [2025-01-09 03:28:50,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:28:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 03:28:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:50,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 03:28:50,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=235, Unknown=1, NotChecked=0, Total=306 [2025-01-09 03:28:50,311 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:28:54,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:28:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:54,643 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2025-01-09 03:28:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:28:54,644 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 46 [2025-01-09 03:28:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:54,646 INFO L225 Difference]: With dead ends: 138 [2025-01-09 03:28:54,646 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 03:28:54,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=100, Invalid=319, Unknown=1, NotChecked=0, Total=420 [2025-01-09 03:28:54,649 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:54,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 195 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 168 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 03:28:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 03:28:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2025-01-09 03:28:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 85 states have internal predecessors, (96), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 03:28:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2025-01-09 03:28:54,671 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 46 [2025-01-09 03:28:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:54,672 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2025-01-09 03:28:54,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:28:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2025-01-09 03:28:54,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 03:28:54,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:54,675 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:54,681 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:28:54,875 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:28:54,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1829451524, now seen corresponding path program 1 times [2025-01-09 03:28:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456087000] [2025-01-09 03:28:54,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:54,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 03:28:54,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 03:28:54,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:54,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 03:28:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456087000] [2025-01-09 03:28:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456087000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:28:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008234631] [2025-01-09 03:28:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:54,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:54,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:54,982 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:28:54,986 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:28:55,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 03:28:55,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 03:28:55,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:55,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:55,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:28:55,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:28:55,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:28:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 03:28:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008234631] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:28:55,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:28:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-01-09 03:28:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998956313] [2025-01-09 03:28:55,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:28:55,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:28:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:28:55,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:28:55,147 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 03:28:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:55,299 INFO L93 Difference]: Finished difference Result 251 states and 309 transitions. [2025-01-09 03:28:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:28:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 51 [2025-01-09 03:28:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:55,300 INFO L225 Difference]: With dead ends: 251 [2025-01-09 03:28:55,300 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 03:28:55,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:28:55,301 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 85 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:55,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 185 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:28:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 03:28:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2025-01-09 03:28:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.1917808219178083) internal successors, (174), 157 states have internal predecessors, (174), 51 states have call successors, (51), 26 states have call predecessors, (51), 25 states have return successors, (47), 39 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:28:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2025-01-09 03:28:55,326 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 51 [2025-01-09 03:28:55,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:55,327 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2025-01-09 03:28:55,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 03:28:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2025-01-09 03:28:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:28:55,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:55,329 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:55,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:28:55,529 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:28:55,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:55,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1713257457, now seen corresponding path program 1 times [2025-01-09 03:28:55,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:55,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536831923] [2025-01-09 03:28:55,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:55,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:55,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:28:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:28:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:28:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158192613] [2025-01-09 03:28:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:28:55,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:55,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:55,571 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:28:55,573 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:28:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:28:55,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:28:55,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:55,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:28:55,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 03:28:55,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:28:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 40 proven. 30 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 03:28:56,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:29:50,290 WARN L286 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)