./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.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-ll_unwindbound5.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 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:27:06,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:27:07,044 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:27:07,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:27:07,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:27:07,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:27:07,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:27:07,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:27:07,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:27:07,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:27:07,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:27:07,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:27:07,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:27:07,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:27:07,077 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:27:07,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:27:07,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:27:07,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:27:07,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:27:07,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:27:07,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:27:07,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:27:07,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:27:07,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:27:07,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:27:07,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:27:07,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:27:07,080 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 -> 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe [2025-01-09 03:27:07,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:27:07,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:27:07,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:27:07,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:27:07,294 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:27:07,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-01-09 03:27:08,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df3373920/f24343c0b3a24587ad8819f2882139e7/FLAG2bd3c211f [2025-01-09 03:27:08,661 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:27:08,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-01-09 03:27:08,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df3373920/f24343c0b3a24587ad8819f2882139e7/FLAG2bd3c211f [2025-01-09 03:27:08,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df3373920/f24343c0b3a24587ad8819f2882139e7 [2025-01-09 03:27:08,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:27:08,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:27:08,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:27:08,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:27:08,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:27:08,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08, skipping insertion in model container [2025-01-09 03:27:08,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:27:08,795 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-ll_unwindbound5.c[538,551] [2025-01-09 03:27:08,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:27:08,822 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:27:08,831 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-ll_unwindbound5.c[538,551] [2025-01-09 03:27:08,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:27:08,848 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:27:08,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08 WrapperNode [2025-01-09 03:27:08,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:27:08,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:27:08,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:27:08,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:27:08,854 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:27:08" (1/1) ... [2025-01-09 03:27:08,863 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:27:08" (1/1) ... [2025-01-09 03:27:08,880 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-01-09 03:27:08,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:27:08,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:27:08,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:27:08,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:27:08,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,899 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:27:08,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:27:08,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:27:08,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:27:08,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:27:08,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (1/1) ... [2025-01-09 03:27:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:27:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:08,938 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:27:08,941 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:27:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:27:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:27:08,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:27:08,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:27:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:27:08,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:27:09,008 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:27:09,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:27:09,111 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:27:09,111 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:27:09,116 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:27:09,117 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:27:09,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:09 BoogieIcfgContainer [2025-01-09 03:27:09,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:27:09,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:27:09,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:27:09,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:27:09,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:08" (1/3) ... [2025-01-09 03:27:09,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727ad0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:09, skipping insertion in model container [2025-01-09 03:27:09,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:08" (2/3) ... [2025-01-09 03:27:09,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727ad0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:09, skipping insertion in model container [2025-01-09 03:27:09,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:09" (3/3) ... [2025-01-09 03:27:09,125 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound5.c [2025-01-09 03:27:09,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:27:09,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_unwindbound5.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:27:09,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:27:09,185 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;@4ed0398e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:27:09,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:27:09,188 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:27:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:27:09,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:09,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:09,194 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:09,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2025-01-09 03:27:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426160465] [2025-01-09 03:27:09,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:09,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:27:09,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:27:09,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:09,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:09,299 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:27:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426160465] [2025-01-09 03:27:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426160465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:27:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119593885] [2025-01-09 03:27:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:09,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:27:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:09,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:27:09,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:27:09,320 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:27:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:09,336 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2025-01-09 03:27:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:27:09,338 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:27:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:09,343 INFO L225 Difference]: With dead ends: 53 [2025-01-09 03:27:09,343 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 03:27:09,345 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:27:09,349 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:27:09,350 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:27:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 03:27:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 03:27:09,375 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:27:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-01-09 03:27:09,380 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2025-01-09 03:27:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-01-09 03:27:09,381 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:27:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-01-09 03:27:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:27:09,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:09,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:09,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:27:09,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:09,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2015332289, now seen corresponding path program 1 times [2025-01-09 03:27:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485898394] [2025-01-09 03:27:09,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:09,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:27:09,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:27:09,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:09,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:09,492 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:27:09,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485898394] [2025-01-09 03:27:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485898394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:09,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:09,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:27:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028887860] [2025-01-09 03:27:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:09,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:09,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:09,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:09,494 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:27:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:09,542 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-01-09 03:27:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:09,543 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:27:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:09,543 INFO L225 Difference]: With dead ends: 38 [2025-01-09 03:27:09,543 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 03:27:09,543 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:27:09,544 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:27:09,544 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:27:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 03:27:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-01-09 03:27:09,549 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:27:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-09 03:27:09,549 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-01-09 03:27:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-09 03:27:09,550 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:27:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-09 03:27:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:27:09,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:09,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:09,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:27:09,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 902164894, now seen corresponding path program 1 times [2025-01-09 03:27:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138197670] [2025-01-09 03:27:09,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:09,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:27:09,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:27:09,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:09,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:09,624 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:27:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138197670] [2025-01-09 03:27:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138197670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:09,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:27:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627633230] [2025-01-09 03:27:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:27:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:09,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:27:09,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:27:09,625 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:27:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:09,641 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-01-09 03:27:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:27:09,643 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:27:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:09,644 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:27:09,644 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 03:27:09,644 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:27:09,646 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:27:09,646 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:27:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 03:27:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 03:27:09,652 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:27:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-01-09 03:27:09,653 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2025-01-09 03:27:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-01-09 03:27:09,653 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:27:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-01-09 03:27:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:27:09,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:09,654 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:09,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:27:09,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:09,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1435955584, now seen corresponding path program 1 times [2025-01-09 03:27:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865930358] [2025-01-09 03:27:09,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:09,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:27:09,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:27:09,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:09,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:09,765 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:27:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865930358] [2025-01-09 03:27:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865930358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:09,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:27:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508947951] [2025-01-09 03:27:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:09,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:09,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:09,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:09,782 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:27:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:09,836 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-01-09 03:27:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:09,837 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:27:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:09,838 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:27:09,839 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 03:27:09,839 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:27:09,840 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:27:09,840 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:27:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 03:27:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-01-09 03:27:09,845 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:27:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-01-09 03:27:09,846 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2025-01-09 03:27:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:09,846 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-01-09 03:27:09,846 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:27:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-01-09 03:27:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:27:09,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:09,849 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:27:09,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:27:09,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:09,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1121341599, now seen corresponding path program 1 times [2025-01-09 03:27:09,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:09,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485248426] [2025-01-09 03:27:09,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:09,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:27:09,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:27:09,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:09,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:27:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170539157] [2025-01-09 03:27:09,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:09,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:09,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:09,870 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:27:09,871 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:27:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:27:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:27:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:09,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:09,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:27:09,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:10,010 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:27:10,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:27:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485248426] [2025-01-09 03:27:10,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:27:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170539157] [2025-01-09 03:27:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170539157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:10,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:27:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494210920] [2025-01-09 03:27:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:10,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:10,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:10,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:10,012 INFO L87 Difference]: Start difference. First operand 34 states and 42 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, (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:27:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:10,079 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-01-09 03:27:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:10,080 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, (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:27:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:10,081 INFO L225 Difference]: With dead ends: 63 [2025-01-09 03:27:10,081 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 03:27:10,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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:27:10,081 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:10,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 03:27:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 03:27:10,089 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:27:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-01-09 03:27:10,091 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-01-09 03:27:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:10,091 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-01-09 03:27:10,091 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, (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:27:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-01-09 03:27:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 03:27:10,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:10,092 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:27:10,099 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:27:10,294 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:27:10,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1012149342, now seen corresponding path program 1 times [2025-01-09 03:27:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258058880] [2025-01-09 03:27:10,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:10,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:27:10,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:27:10,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:10,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:27:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551181854] [2025-01-09 03:27:10,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:10,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:10,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:10,310 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:27:10,312 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:27:10,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:27:10,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:27:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:10,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:27:10,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:27:10,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:27:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258058880] [2025-01-09 03:27:10,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:27:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551181854] [2025-01-09 03:27:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551181854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:27:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912497856] [2025-01-09 03:27:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:10,422 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:27:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:10,475 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-01-09 03:27:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-09 03:27:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:10,476 INFO L225 Difference]: With dead ends: 62 [2025-01-09 03:27:10,478 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 03:27:10,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:27:10,478 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:10,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 85 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 03:27:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-01-09 03:27:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:27:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2025-01-09 03:27:10,491 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 28 [2025-01-09 03:27:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:10,492 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2025-01-09 03:27:10,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:27:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2025-01-09 03:27:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 03:27:10,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:10,493 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:10,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:10,694 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:27:10,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:10,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -423948294, now seen corresponding path program 1 times [2025-01-09 03:27:10,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:10,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-01-09 03:27:10,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:10,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:10,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 03:27:10,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 03:27:10,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:10,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:10,778 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:27:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-01-09 03:27:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259035135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289152375] [2025-01-09 03:27:10,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:10,780 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:27:10,782 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:27:10,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 03:27:10,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 03:27:10,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:10,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:27:10,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:27:10,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:27:10,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289152375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:10,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:27:10,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-01-09 03:27:10,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459864890] [2025-01-09 03:27:10,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:10,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:27:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:10,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:27:10,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:27:10,895 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:27:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:11,013 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2025-01-09 03:27:11,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:27:11,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 35 [2025-01-09 03:27:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:11,015 INFO L225 Difference]: With dead ends: 157 [2025-01-09 03:27:11,015 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 03:27:11,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 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:27:11,016 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:11,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:27:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 03:27:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2025-01-09 03:27:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 85 states have internal predecessors, (97), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 03:27:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2025-01-09 03:27:11,035 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 35 [2025-01-09 03:27:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:11,035 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2025-01-09 03:27:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:27:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2025-01-09 03:27:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 03:27:11,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:11,036 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:27:11,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:11,236 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:27:11,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -897447482, now seen corresponding path program 1 times [2025-01-09 03:27:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-01-09 03:27:11,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:11,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 03:27:11,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 03:27:11,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:27:11,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100659305] [2025-01-09 03:27:11,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:11,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:11,249 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:27:11,250 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:27:11,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 03:27:11,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 03:27:11,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:11,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:11,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:27:11,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:11,372 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:27:11,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 03:27:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-01-09 03:27:11,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:27:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100659305] [2025-01-09 03:27:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100659305] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:11,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:27:11,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 03:27:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520905348] [2025-01-09 03:27:11,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:11,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:11,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:11,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:27:11,453 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:27:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:11,516 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2025-01-09 03:27:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-01-09 03:27:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:11,517 INFO L225 Difference]: With dead ends: 148 [2025-01-09 03:27:11,517 INFO L226 Difference]: Without dead ends: 142 [2025-01-09 03:27:11,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:27:11,518 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:11,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-09 03:27:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-01-09 03:27:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 03:27:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2025-01-09 03:27:11,544 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 38 [2025-01-09 03:27:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:11,546 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2025-01-09 03:27:11,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:27:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2025-01-09 03:27:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 03:27:11,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:11,547 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:11,554 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:27:11,747 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:27:11,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:11,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 800816503, now seen corresponding path program 1 times [2025-01-09 03:27:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329584060] [2025-01-09 03:27:11,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:11,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 03:27:11,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 03:27:11,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:11,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 03:27:11,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:11,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329584060] [2025-01-09 03:27:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329584060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:27:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:27:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003626881] [2025-01-09 03:27:11,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:11,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:11,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:11,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:11,854 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 03:27:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:11,902 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2025-01-09 03:27:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2025-01-09 03:27:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:11,903 INFO L225 Difference]: With dead ends: 139 [2025-01-09 03:27:11,903 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 03:27:11,903 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:27:11,904 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:11,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 03:27:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 03:27:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 82 states have internal predecessors, (93), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 03:27:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2025-01-09 03:27:11,923 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 44 [2025-01-09 03:27:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:11,923 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2025-01-09 03:27:11,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 03:27:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2025-01-09 03:27:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 03:27:11,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:11,924 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:27:11,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:27:11,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:11,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1829451524, now seen corresponding path program 1 times [2025-01-09 03:27:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130048240] [2025-01-09 03:27:11,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:11,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 03:27:11,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 03:27:11,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:11,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:12,011 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:27:12,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130048240] [2025-01-09 03:27:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130048240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297840382] [2025-01-09 03:27:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:12,015 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:27:12,016 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:27:12,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 03:27:12,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 03:27:12,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:12,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:12,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:27:12,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:12,100 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:27:12,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:12,154 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:27:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297840382] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:12,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:27:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2025-01-09 03:27:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803758862] [2025-01-09 03:27:12,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:12,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:27:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:12,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:27:12,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:27:12,155 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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:27:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:12,252 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2025-01-09 03:27:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:27:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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:27:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:12,254 INFO L225 Difference]: With dead ends: 196 [2025-01-09 03:27:12,254 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 03:27:12,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:27:12,254 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:12,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 159 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:27:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 03:27:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2025-01-09 03:27:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1785714285714286) internal successors, (132), 118 states have internal predecessors, (132), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 03:27:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2025-01-09 03:27:12,272 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 51 [2025-01-09 03:27:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:12,273 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2025-01-09 03:27:12,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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:27:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2025-01-09 03:27:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 03:27:12,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:12,276 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:27:12,282 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:27:12,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:27:12,477 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1713257457, now seen corresponding path program 1 times [2025-01-09 03:27:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438143581] [2025-01-09 03:27:12,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:12,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:27:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:27:12,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:12,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:27:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110155884] [2025-01-09 03:27:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:12,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:12,510 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:27:12,512 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:27:12,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 03:27:12,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 03:27:12,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:12,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 03:27:12,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:27:13,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:27:14,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:14,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438143581] [2025-01-09 03:27:14,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:27:14,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110155884] [2025-01-09 03:27:14,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110155884] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:14,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:27:14,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-01-09 03:27:14,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490727482] [2025-01-09 03:27:14,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:14,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 03:27:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:14,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 03:27:14,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-01-09 03:27:14,725 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 03:27:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:15,547 INFO L93 Difference]: Finished difference Result 283 states and 361 transitions. [2025-01-09 03:27:15,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 03:27:15,548 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 60 [2025-01-09 03:27:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:15,551 INFO L225 Difference]: With dead ends: 283 [2025-01-09 03:27:15,551 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 03:27:15,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:27:15,552 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 96 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:15,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 364 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:27:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 03:27:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 198. [2025-01-09 03:27:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.1865671641791045) internal successors, (159), 140 states have internal predecessors, (159), 39 states have call successors, (39), 24 states have call predecessors, (39), 24 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 03:27:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 235 transitions. [2025-01-09 03:27:15,575 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 235 transitions. Word has length 60 [2025-01-09 03:27:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:15,575 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 235 transitions. [2025-01-09 03:27:15,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 03:27:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 235 transitions. [2025-01-09 03:27:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 03:27:15,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:15,576 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:15,582 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:27:15,777 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,SelfDestructingSolverStorable10 [2025-01-09 03:27:15,777 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:15,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash -156870313, now seen corresponding path program 1 times [2025-01-09 03:27:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:15,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617757344] [2025-01-09 03:27:15,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:15,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:27:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:27:15,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:15,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:27:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766133963] [2025-01-09 03:27:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:15,807 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:27:15,808 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:27:15,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 03:27:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 03:27:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:15,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 03:27:15,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 03:27:16,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 03:27:16,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:16,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617757344] [2025-01-09 03:27:16,723 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:27:16,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766133963] [2025-01-09 03:27:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766133963] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:16,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:27:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-01-09 03:27:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460303842] [2025-01-09 03:27:16,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 03:27:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:16,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 03:27:16,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:27:16,724 INFO L87 Difference]: Start difference. First operand 198 states and 235 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2025-01-09 03:27:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:17,242 INFO L93 Difference]: Finished difference Result 288 states and 362 transitions. [2025-01-09 03:27:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:27:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 71 [2025-01-09 03:27:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:17,244 INFO L225 Difference]: With dead ends: 288 [2025-01-09 03:27:17,244 INFO L226 Difference]: Without dead ends: 247 [2025-01-09 03:27:17,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2025-01-09 03:27:17,245 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:17,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 363 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:27:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-09 03:27:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 209. [2025-01-09 03:27:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 142 states have (on average 1.1971830985915493) internal successors, (170), 145 states have internal predecessors, (170), 42 states have call successors, (42), 25 states have call predecessors, (42), 24 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 03:27:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-01-09 03:27:17,273 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 71 [2025-01-09 03:27:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:17,273 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-01-09 03:27:17,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2025-01-09 03:27:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-01-09 03:27:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:27:17,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:17,274 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:17,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:17,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:17,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2119581721, now seen corresponding path program 2 times [2025-01-09 03:27:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859435569] [2025-01-09 03:27:17,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:27:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:17,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-01-09 03:27:17,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:27:17,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:27:17,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 03:27:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859435569] [2025-01-09 03:27:17,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859435569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158149460] [2025-01-09 03:27:17,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:27:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:17,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:27:17,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:27:17,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-01-09 03:27:17,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:27:17,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:27:17,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:17,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:27:17,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 03:27:17,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 03:27:17,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158149460] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:17,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:27:17,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 03:27:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778307090] [2025-01-09 03:27:17,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:17,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:17,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:17,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:17,757 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:27:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:17,816 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2025-01-09 03:27:17,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:27:17,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 74 [2025-01-09 03:27:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:17,818 INFO L225 Difference]: With dead ends: 233 [2025-01-09 03:27:17,818 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 03:27:17,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:27:17,818 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:17,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 03:27:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-09 03:27:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 137 states have (on average 1.1897810218978102) internal successors, (163), 140 states have internal predecessors, (163), 42 states have call successors, (42), 25 states have call predecessors, (42), 24 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 03:27:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 245 transitions. [2025-01-09 03:27:17,844 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 245 transitions. Word has length 74 [2025-01-09 03:27:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:17,844 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 245 transitions. [2025-01-09 03:27:17,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:27:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 245 transitions. [2025-01-09 03:27:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 03:27:17,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:17,845 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:17,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:18,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:18,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:18,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -894594264, now seen corresponding path program 1 times [2025-01-09 03:27:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668949936] [2025-01-09 03:27:18,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:18,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:27:18,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:27:18,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:18,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:27:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668949936] [2025-01-09 03:27:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668949936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274432791] [2025-01-09 03:27:18,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:18,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:27:18,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:27:18,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 03:27:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 03:27:18,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:18,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:18,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 03:27:18,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:27:18,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:27:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274432791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:18,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:27:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 17 [2025-01-09 03:27:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449234450] [2025-01-09 03:27:18,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:18,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 03:27:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:18,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 03:27:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:27:18,853 INFO L87 Difference]: Start difference. First operand 204 states and 245 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 03:27:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:19,067 INFO L93 Difference]: Finished difference Result 218 states and 265 transitions. [2025-01-09 03:27:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:27:19,067 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) Word has length 76 [2025-01-09 03:27:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:19,068 INFO L225 Difference]: With dead ends: 218 [2025-01-09 03:27:19,068 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 03:27:19,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-01-09 03:27:19,069 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 33 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:19,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 306 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:27:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 03:27:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2025-01-09 03:27:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 127 states have internal predecessors, (149), 38 states have call successors, (38), 23 states have call predecessors, (38), 22 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 03:27:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 223 transitions. [2025-01-09 03:27:19,093 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 223 transitions. Word has length 76 [2025-01-09 03:27:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:19,093 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 223 transitions. [2025-01-09 03:27:19,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-01-09 03:27:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2025-01-09 03:27:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:27:19,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:19,094 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:19,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:19,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:19,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash 693389829, now seen corresponding path program 1 times [2025-01-09 03:27:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:19,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063516941] [2025-01-09 03:27:19,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:19,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:27:19,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:27:19,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 03:27:19,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063516941] [2025-01-09 03:27:19,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063516941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49742719] [2025-01-09 03:27:19,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:19,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:19,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:19,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:27:19,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 03:27:19,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:27:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:27:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:19,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:27:19,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-01-09 03:27:19,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:27:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49742719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:27:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:27:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-01-09 03:27:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818273518] [2025-01-09 03:27:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:27:19,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:27:19,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:19,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:27:19,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:27:19,448 INFO L87 Difference]: Start difference. First operand 185 states and 223 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:27:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:19,504 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2025-01-09 03:27:19,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:27:19,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 80 [2025-01-09 03:27:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:19,506 INFO L225 Difference]: With dead ends: 206 [2025-01-09 03:27:19,506 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 03:27:19,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:27:19,507 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:19,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 103 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 03:27:19,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2025-01-09 03:27:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 120 states have (on average 1.175) internal successors, (141), 122 states have internal predecessors, (141), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 03:27:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 212 transitions. [2025-01-09 03:27:19,528 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 212 transitions. Word has length 80 [2025-01-09 03:27:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:19,529 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 212 transitions. [2025-01-09 03:27:19,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:27:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 212 transitions. [2025-01-09 03:27:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:27:19,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:19,529 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:19,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:19,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 03:27:19,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 208094439, now seen corresponding path program 1 times [2025-01-09 03:27:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-01-09 03:27:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:19,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:27:19,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:27:19,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 03:27:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935448622] [2025-01-09 03:27:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935448622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332200271] [2025-01-09 03:27:19,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:19,825 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:27:19,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 03:27:19,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:27:19,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:27:19,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:19,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:19,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:27:19,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:27:19,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 03:27:20,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332200271] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:20,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:27:20,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-01-09 03:27:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011556709] [2025-01-09 03:27:20,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:20,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:27:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:20,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:27:20,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:27:20,011 INFO L87 Difference]: Start difference. First operand 178 states and 212 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-01-09 03:27:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:20,093 INFO L93 Difference]: Finished difference Result 248 states and 308 transitions. [2025-01-09 03:27:20,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:27:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 89 [2025-01-09 03:27:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:20,094 INFO L225 Difference]: With dead ends: 248 [2025-01-09 03:27:20,094 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 03:27:20,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:27:20,095 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:20,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 118 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:27:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 03:27:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-01-09 03:27:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 124 states have internal predecessors, (143), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 03:27:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2025-01-09 03:27:20,126 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 89 [2025-01-09 03:27:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2025-01-09 03:27:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-01-09 03:27:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2025-01-09 03:27:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:27:20,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:20,128 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:20,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:20,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 03:27:20,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:20,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -180996608, now seen corresponding path program 3 times [2025-01-09 03:27:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222438125] [2025-01-09 03:27:20,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:27:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:20,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-01-09 03:27:20,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 87 of 92 statements. [2025-01-09 03:27:20,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 03:27:20,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 03:27:20,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:27:20,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222438125] [2025-01-09 03:27:20,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222438125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:27:20,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217811552] [2025-01-09 03:27:20,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:27:20,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:20,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:20,485 INFO L229 MonitoredProcess]: Starting monitored process 13 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:27:20,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 03:27:20,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-01-09 03:27:20,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 64 of 92 statements. [2025-01-09 03:27:20,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 03:27:20,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:20,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 03:27:20,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 03:27:20,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:27:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 03:27:34,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217811552] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:27:34,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:27:34,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2025-01-09 03:27:34,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308098379] [2025-01-09 03:27:34,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:27:34,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:27:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:27:34,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:27:34,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:27:34,016 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) [2025-01-09 03:27:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:27:50,514 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2025-01-09 03:27:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 03:27:50,515 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) Word has length 92 [2025-01-09 03:27:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:27:50,516 INFO L225 Difference]: With dead ends: 228 [2025-01-09 03:27:50,516 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 03:27:50,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=578, Invalid=3204, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 03:27:50,518 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 107 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 152 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:27:50,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 574 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 855 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 03:27:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 03:27:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2025-01-09 03:27:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 99 states have internal predecessors, (101), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 03:27:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2025-01-09 03:27:50,546 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 92 [2025-01-09 03:27:50,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:27:50,546 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2025-01-09 03:27:50,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) [2025-01-09 03:27:50,546 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2025-01-09 03:27:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:27:50,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:27:50,547 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:27:50,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 03:27:50,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 03:27:50,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:27:50,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:27:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash -179030402, now seen corresponding path program 1 times [2025-01-09 03:27:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:27:50,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404910753] [2025-01-09 03:27:50,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:50,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:27:50,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:27:50,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:27:50,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:50,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:27:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211908299] [2025-01-09 03:27:50,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:27:50,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:27:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:27:50,778 INFO L229 MonitoredProcess]: Starting monitored process 14 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:27:50,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 03:27:50,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:27:50,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:27:50,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:27:50,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:27:50,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 03:27:50,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:27:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 03:27:51,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:28:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 03:28:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:28:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404910753] [2025-01-09 03:28:21,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:28:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211908299] [2025-01-09 03:28:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211908299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:28:21,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:28:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-01-09 03:28:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120108746] [2025-01-09 03:28:21,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:28:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 03:28:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:28:21,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 03:28:21,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-01-09 03:28:21,222 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-01-09 03:28:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:28:22,492 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2025-01-09 03:28:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 03:28:22,492 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 92 [2025-01-09 03:28:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:28:22,494 INFO L225 Difference]: With dead ends: 157 [2025-01-09 03:28:22,494 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 03:28:22,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-01-09 03:28:22,495 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:28:22,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 469 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:28:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 03:28:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2025-01-09 03:28:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 100 states have internal predecessors, (103), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 03:28:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2025-01-09 03:28:22,517 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 92 [2025-01-09 03:28:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:28:22,518 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2025-01-09 03:28:22,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-01-09 03:28:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2025-01-09 03:28:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:28:22,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:28:22,519 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:22,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 03:28:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 03:28:22,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:28:22,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:28:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2126099739, now seen corresponding path program 2 times [2025-01-09 03:28:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:28:22,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686816241] [2025-01-09 03:28:22,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:28:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:28:22,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-01-09 03:28:22,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:28:22,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:28:22,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:28:22,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344757915] [2025-01-09 03:28:22,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:28:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:28:22,736 INFO L229 MonitoredProcess]: Starting monitored process 15 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:22,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 03:28:22,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-01-09 03:28:22,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:28:22,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:28:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:28:22,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:28:22,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:28:22,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:28:22,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:28:22,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:28:22,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:28:22,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:28:22,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:28:22,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 03:28:23,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:28:23,038 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:28:23,071 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:28:23,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:28:23 BoogieIcfgContainer [2025-01-09 03:28:23,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:28:23,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:28:23,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:28:23,078 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:28:23,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:09" (3/4) ... [2025-01-09 03:28:23,079 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:28:23,134 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 60. [2025-01-09 03:28:23,205 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:28:23,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:28:23,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:28:23,208 INFO L158 Benchmark]: Toolchain (without parser) took 74530.88ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 105.7MB in the beginning and 238.4MB in the end (delta: -132.7MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2025-01-09 03:28:23,208 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:28:23,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.72ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 93.6MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:28:23,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.42ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:28:23,208 INFO L158 Benchmark]: Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:28:23,208 INFO L158 Benchmark]: RCFGBuilder took 205.48ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 79.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:28:23,209 INFO L158 Benchmark]: TraceAbstraction took 73958.78ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 79.1MB in the beginning and 251.0MB in the end (delta: -171.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-01-09 03:28:23,209 INFO L158 Benchmark]: Witness Printer took 129.97ms. Allocated memory is still 377.5MB. Free memory was 251.0MB in the beginning and 238.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:28:23,209 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.72ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 93.6MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.42ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.38ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 205.48ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 79.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 73958.78ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 79.1MB in the beginning and 251.0MB in the end (delta: -171.9MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 129.97ms. Allocated memory is still 377.5MB. Free memory was 251.0MB in the beginning and 238.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=4, B=1, counter=0, d=1, p=1, q=0, r=4] [L35] EXPR counter++ VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=1, d=2, p=2, q=0, r=4] [L35] EXPR counter++ VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=2, d=4, p=4, q=0, r=4] [L35] EXPR counter++ VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=3, d=8, p=8, q=0, r=4] [L35] EXPR counter++ VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L39] COND TRUE !(r >= d) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L45] EXPR counter++ VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L45] COND TRUE counter++<5 [L46] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(A == q*B + r) VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L47] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L47] RET __VERIFIER_assert(d == B*p) VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L49] COND FALSE !(!(p != 1)) [L51] d = d / 2 [L52] p = p / 2 VAL [A=4, B=1, counter=5, d=4, p=4, q=0, r=4] [L53] COND TRUE r >= d [L54] r = r - d [L55] q = q + p VAL [A=4, B=1, counter=5, d=4, p=4, q=4, r=0] [L45] EXPR counter++ VAL [A=4, B=1, counter=6, d=4, p=4, q=4, r=0] [L45] COND FALSE !(counter++<5) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.9s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 3449 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2793 mSDsCounter, 389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2458 IncrementalHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 389 mSolverCounterUnsat, 656 mSDtfsCounter, 2458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1373 SyntacticMatches, 10 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=12, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 144 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 49.4s InterpolantComputationTime, 1895 NumberOfCodeBlocks, 1862 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2037 ConstructedInterpolants, 0 QuantifiedInterpolants, 37965 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1973 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 5554/6327 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:28:23,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE