./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/bresenham-ll_unwindbound50.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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:26:50,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:26:50,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:26:50,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:26:50,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:26:50,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:26:50,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:26:50,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:26:50,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:26:50,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:26:50,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:26:50,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:26:50,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:26:50,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:26:50,941 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:26:50,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:26:50,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:26:50,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:26:50,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:26:50,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:26:50,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:26:50,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:26:50,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:26:50,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:26:50,944 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2025-02-07 20:26:51,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:26:51,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:26:51,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:26:51,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:26:51,200 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:26:51,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2025-02-07 20:26:52,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397ce3639/e727326252cd45d5b1570cc058a51e8b/FLAGf3195f737 [2025-02-07 20:26:52,614 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:26:52,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2025-02-07 20:26:52,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397ce3639/e727326252cd45d5b1570cc058a51e8b/FLAGf3195f737 [2025-02-07 20:26:52,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397ce3639/e727326252cd45d5b1570cc058a51e8b [2025-02-07 20:26:52,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:26:52,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:26:52,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:26:52,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:26:52,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:26:52,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5403b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52, skipping insertion in model container [2025-02-07 20:26:52,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:26:52,799 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/bresenham-ll_unwindbound50.c[597,610] [2025-02-07 20:26:52,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:26:52,824 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:26:52,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/bresenham-ll_unwindbound50.c[597,610] [2025-02-07 20:26:52,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:26:52,846 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:26:52,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52 WrapperNode [2025-02-07 20:26:52,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:26:52,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:26:52,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:26:52,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:26:52,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,866 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-02-07 20:26:52,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:26:52,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:26:52,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:26:52,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:26:52,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,885 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-02-07 20:26:52,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:26:52,891 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:26:52,891 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:26:52,891 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:26:52,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (1/1) ... [2025-02-07 20:26:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:26:52,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:52,921 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-02-07 20:26:52,926 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-02-07 20:26:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:26:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:26:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:26:52,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:26:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:26:52,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:26:52,987 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:26:52,989 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:26:53,089 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-07 20:26:53,089 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:26:53,096 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:26:53,096 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:26:53,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:26:53 BoogieIcfgContainer [2025-02-07 20:26:53,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:26:53,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:26:53,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:26:53,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:26:53,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:26:52" (1/3) ... [2025-02-07 20:26:53,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f58b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:26:53, skipping insertion in model container [2025-02-07 20:26:53,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:52" (2/3) ... [2025-02-07 20:26:53,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f58b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:26:53, skipping insertion in model container [2025-02-07 20:26:53,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:26:53" (3/3) ... [2025-02-07 20:26:53,104 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2025-02-07 20:26:53,113 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:26:53,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound50.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:26:53,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:26:53,152 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;@1029c235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:26:53,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:26:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:26:53,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:53,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:53,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1740476856, now seen corresponding path program 1 times [2025-02-07 20:26:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969625150] [2025-02-07 20:26:53,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:53,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:26:53,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:26:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:53,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362161733] [2025-02-07 20:26:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:53,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:53,252 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-02-07 20:26:53,254 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-02-07 20:26:53,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:26:53,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:26:53,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:53,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:53,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:26:53,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:53,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:26:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969625150] [2025-02-07 20:26:53,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362161733] [2025-02-07 20:26:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362161733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:26:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:26:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:26:53,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692093527] [2025-02-07 20:26:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:26:53,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:26:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:53,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:26:53,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:26:53,491 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-02-07 20:26:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:53,607 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2025-02-07 20:26:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:26:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2025-02-07 20:26:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:53,614 INFO L225 Difference]: With dead ends: 48 [2025-02-07 20:26:53,614 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:26:53,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:26:53,618 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:53,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:26:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-02-07 20:26:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-07 20:26:53,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 7 [2025-02-07 20:26:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-07 20:26:53,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-02-07 20:26:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-07 20:26:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:26:53,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:53,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:53,656 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-02-07 20:26:53,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 20:26:53,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1829983731, now seen corresponding path program 1 times [2025-02-07 20:26:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553760289] [2025-02-07 20:26:53,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:53,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:26:53,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:26:53,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:53,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553760289] [2025-02-07 20:26:53,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553760289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:26:53,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:26:53,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:26:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533022367] [2025-02-07 20:26:53,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:26:53,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:26:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:53,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:26:53,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:26:53,961 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:26:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:53,976 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-02-07 20:26:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:26:53,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:26:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:53,978 INFO L225 Difference]: With dead ends: 30 [2025-02-07 20:26:53,978 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 20:26:53,978 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-02-07 20:26:53,980 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:53,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 20:26:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-07 20:26:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-07 20:26:53,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2025-02-07 20:26:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:53,987 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-07 20:26:53,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:26:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-07 20:26:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:26:53,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:53,988 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:26:53,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1884708792, now seen corresponding path program 1 times [2025-02-07 20:26:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499994041] [2025-02-07 20:26:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:54,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:26:54,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:26:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:54,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122608178] [2025-02-07 20:26:54,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:54,047 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-02-07 20:26:54,050 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-02-07 20:26:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:26:54,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:26:54,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:54,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:54,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:26:54,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:54,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:26:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499994041] [2025-02-07 20:26:54,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122608178] [2025-02-07 20:26:54,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122608178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:26:54,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:26:54,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:26:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509267320] [2025-02-07 20:26:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:26:54,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:26:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:54,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:26:54,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:26:54,233 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 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-02-07 20:26:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:54,303 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-02-07 20:26:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:26:54,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 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 14 [2025-02-07 20:26:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:54,304 INFO L225 Difference]: With dead ends: 32 [2025-02-07 20:26:54,305 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 20:26:54,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:26:54,306 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:54,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 20:26:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-07 20:26:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-02-07 20:26:54,310 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2025-02-07 20:26:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:54,311 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-07 20:26:54,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 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-02-07 20:26:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-02-07 20:26:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:26:54,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:54,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:54,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:26:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:54,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1620531377, now seen corresponding path program 1 times [2025-02-07 20:26:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473225447] [2025-02-07 20:26:54,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:54,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:26:54,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:26:54,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:54,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:54,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59763786] [2025-02-07 20:26:54,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:54,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:54,540 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-02-07 20:26:54,542 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-02-07 20:26:54,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:26:54,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:26:54,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:54,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:54,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 20:26:54,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:54,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:26:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473225447] [2025-02-07 20:26:54,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59763786] [2025-02-07 20:26:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59763786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:54,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:26:54,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-02-07 20:26:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422911181] [2025-02-07 20:26:54,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:54,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:26:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:54,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:26:54,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:26:54,781 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:54,938 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-07 20:26:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:26:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-02-07 20:26:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:54,939 INFO L225 Difference]: With dead ends: 40 [2025-02-07 20:26:54,939 INFO L226 Difference]: Without dead ends: 36 [2025-02-07 20:26:54,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:26:54,940 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:54,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-07 20:26:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2025-02-07 20:26:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-07 20:26:54,950 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2025-02-07 20:26:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-07 20:26:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-07 20:26:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:26:54,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:54,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:54,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:26:55,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:55,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:55,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1352943446, now seen corresponding path program 1 times [2025-02-07 20:26:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:55,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448564009] [2025-02-07 20:26:55,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:55,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:26:55,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:26:55,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:55,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448564009] [2025-02-07 20:26:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448564009] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692844629] [2025-02-07 20:26:55,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:55,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:55,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:55,260 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-02-07 20:26:55,262 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-02-07 20:26:55,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:26:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:26:55,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:55,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:55,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:26:55,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:55,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692844629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:55,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-07 20:26:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748495576] [2025-02-07 20:26:55,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:26:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:55,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:26:55,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:26:55,347 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:26:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:55,397 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-02-07 20:26:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:26:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2025-02-07 20:26:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:55,398 INFO L225 Difference]: With dead ends: 67 [2025-02-07 20:26:55,398 INFO L226 Difference]: Without dead ends: 61 [2025-02-07 20:26:55,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:26:55,399 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:55,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-07 20:26:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2025-02-07 20:26:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:26:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-07 20:26:55,411 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2025-02-07 20:26:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:55,411 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-07 20:26:55,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:26:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-07 20:26:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:26:55,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:55,412 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:55,418 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-02-07 20:26:55,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:55,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:55,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -281748033, now seen corresponding path program 1 times [2025-02-07 20:26:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:55,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407365057] [2025-02-07 20:26:55,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:55,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:55,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:55,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:55,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880988434] [2025-02-07 20:26:55,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:55,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:55,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:55,632 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-02-07 20:26:55,638 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-02-07 20:26:55,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:55,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:55,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:55,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 20:26:55,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:26:55,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:26:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407365057] [2025-02-07 20:26:55,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880988434] [2025-02-07 20:26:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880988434] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:55,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:26:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-02-07 20:26:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098888425] [2025-02-07 20:26:55,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:55,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:26:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:55,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:26:55,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:26:55,920 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:26:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:56,039 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2025-02-07 20:26:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:26:56,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-02-07 20:26:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:56,040 INFO L225 Difference]: With dead ends: 78 [2025-02-07 20:26:56,040 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 20:26:56,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:26:56,041 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:56,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 20:26:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-07 20:26:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:26:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-02-07 20:26:56,061 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 24 [2025-02-07 20:26:56,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:56,061 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-02-07 20:26:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:26:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2025-02-07 20:26:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:26:56,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:56,062 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:56,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:26:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:56,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1225803776, now seen corresponding path program 1 times [2025-02-07 20:26:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745754146] [2025-02-07 20:26:56,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:56,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:56,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:56,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:56,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942190079] [2025-02-07 20:26:56,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:56,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:56,280 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-02-07 20:26:56,282 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-02-07 20:26:56,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:56,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:56,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:56,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:56,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 20:26:56,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:26:56,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:26:56,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745754146] [2025-02-07 20:26:56,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942190079] [2025-02-07 20:26:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942190079] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:56,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:26:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-02-07 20:26:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034053718] [2025-02-07 20:26:56,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:56,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:26:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:56,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:26:56,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:26:56,894 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 22 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:26:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:57,507 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2025-02-07 20:26:57,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 20:26:57,507 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2025-02-07 20:26:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:57,508 INFO L225 Difference]: With dead ends: 88 [2025-02-07 20:26:57,508 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 20:26:57,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2025-02-07 20:26:57,509 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:57,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 101 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 20:26:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 20:26:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-02-07 20:26:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:26:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-02-07 20:26:57,521 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 24 [2025-02-07 20:26:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:57,521 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-02-07 20:26:57,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:26:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-02-07 20:26:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:26:57,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:57,522 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:57,528 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-02-07 20:26:57,727 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,SelfDestructingSolverStorable6 [2025-02-07 20:26:57,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:57,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:57,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1337727854, now seen corresponding path program 1 times [2025-02-07 20:26:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:57,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210807918] [2025-02-07 20:26:57,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:57,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:57,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 20:26:57,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:57,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:57,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210807918] [2025-02-07 20:26:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210807918] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186497982] [2025-02-07 20:26:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:57,989 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-02-07 20:26:57,991 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-02-07 20:26:58,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 20:26:58,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 20:26:58,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:58,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186497982] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:58,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-07 20:26:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555226915] [2025-02-07 20:26:58,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 20:26:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:58,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 20:26:58,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-07 20:26:58,448 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:26:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:58,605 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-02-07 20:26:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:26:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 44 [2025-02-07 20:26:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:58,606 INFO L225 Difference]: With dead ends: 104 [2025-02-07 20:26:58,607 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 20:26:58,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:26:58,607 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:58,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 20:26:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2025-02-07 20:26:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:26:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2025-02-07 20:26:58,628 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 44 [2025-02-07 20:26:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:58,628 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2025-02-07 20:26:58,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:26:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2025-02-07 20:26:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:26:58,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:58,629 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:58,635 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-02-07 20:26:58,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:58,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:58,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash 845450798, now seen corresponding path program 2 times [2025-02-07 20:26:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:58,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392429004] [2025-02-07 20:26:58,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:26:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:58,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-07 20:26:58,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:58,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:26:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:58,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392429004] [2025-02-07 20:26:58,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392429004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:58,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369333919] [2025-02-07 20:26:58,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:26:58,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:58,912 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-02-07 20:26:58,914 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-02-07 20:26:58,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-07 20:26:58,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:58,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:26:58,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:58,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:26:58,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 20:26:58,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369333919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:59,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:59,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-07 20:26:59,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996448477] [2025-02-07 20:26:59,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:59,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:26:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:59,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:26:59,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:26:59,053 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 20:26:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:59,119 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2025-02-07 20:26:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:26:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-07 20:26:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:59,121 INFO L225 Difference]: With dead ends: 119 [2025-02-07 20:26:59,121 INFO L226 Difference]: Without dead ends: 95 [2025-02-07 20:26:59,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:26:59,121 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:59,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-07 20:26:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-07 20:26:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 76 states have internal predecessors, (89), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:26:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2025-02-07 20:26:59,141 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 44 [2025-02-07 20:26:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:59,141 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2025-02-07 20:26:59,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 20:26:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2025-02-07 20:26:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:26:59,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:59,143 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:59,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 20:26:59,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:59,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:59,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1231758545, now seen corresponding path program 3 times [2025-02-07 20:26:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747640492] [2025-02-07 20:26:59,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:26:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:59,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-02-07 20:26:59,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:59,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:26:59,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747640492] [2025-02-07 20:26:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747640492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322524312] [2025-02-07 20:26:59,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:26:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:59,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:59,508 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-02-07 20:26:59,509 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-02-07 20:26:59,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-02-07 20:26:59,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 44 statements. [2025-02-07 20:26:59,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 20:26:59,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:59,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 20:26:59,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:59,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-07 20:27:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322524312] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:00,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:27:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2025-02-07 20:27:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848746356] [2025-02-07 20:27:00,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:27:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:00,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:27:00,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-02-07 20:27:00,553 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-07 20:27:07,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:27:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:08,144 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2025-02-07 20:27:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-07 20:27:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 44 [2025-02-07 20:27:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:08,145 INFO L225 Difference]: With dead ends: 117 [2025-02-07 20:27:08,145 INFO L226 Difference]: Without dead ends: 107 [2025-02-07 20:27:08,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=472, Invalid=2498, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 20:27:08,146 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:08,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 230 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 570 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-02-07 20:27:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-07 20:27:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2025-02-07 20:27:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:27:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-02-07 20:27:08,169 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 44 [2025-02-07 20:27:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:08,170 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-02-07 20:27:08,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-07 20:27:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-02-07 20:27:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 20:27:08,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:08,171 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:08,175 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-02-07 20:27:08,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:08,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1266660273, now seen corresponding path program 2 times [2025-02-07 20:27:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939550089] [2025-02-07 20:27:08,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:27:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:08,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:27:08,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:27:08,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:27:08,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:27:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:27:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939550089] [2025-02-07 20:27:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939550089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:27:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220801193] [2025-02-07 20:27:08,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:27:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:08,523 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-02-07 20:27:08,524 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-02-07 20:27:08,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:27:08,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:27:08,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:27:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:08,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:27:08,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:27:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:27:08,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:27:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220801193] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:08,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:27:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-07 20:27:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760322394] [2025-02-07 20:27:08,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:08,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:27:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:08,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:27:08,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:27:08,710 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-07 20:27:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:08,839 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2025-02-07 20:27:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:27:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 48 [2025-02-07 20:27:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:08,841 INFO L225 Difference]: With dead ends: 139 [2025-02-07 20:27:08,841 INFO L226 Difference]: Without dead ends: 133 [2025-02-07 20:27:08,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:27:08,842 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:08,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 140 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:27:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-07 20:27:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-07 20:27:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 107 states have internal predecessors, (120), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:27:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2025-02-07 20:27:08,862 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 48 [2025-02-07 20:27:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2025-02-07 20:27:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-07 20:27:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2025-02-07 20:27:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-07 20:27:08,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:08,865 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:08,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-07 20:27:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:09,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 399062873, now seen corresponding path program 3 times [2025-02-07 20:27:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100554741] [2025-02-07 20:27:09,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:27:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:09,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-02-07 20:27:09,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-02-07 20:27:09,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:27:09,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:27:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:27:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100554741] [2025-02-07 20:27:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100554741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:27:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948313281] [2025-02-07 20:27:09,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:27:09,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:09,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:09,673 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-02-07 20:27:09,673 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-02-07 20:27:09,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-02-07 20:27:09,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 108 statements. [2025-02-07 20:27:09,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 20:27:09,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:09,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 20:27:09,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:27:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-07 20:27:09,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-07 20:27:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948313281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:10,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:27:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 12] total 37 [2025-02-07 20:27:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110155884] [2025-02-07 20:27:10,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:10,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 20:27:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:10,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 20:27:10,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 20:27:10,229 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 37 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 36 states have internal predecessors, (87), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-07 20:27:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:12,010 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2025-02-07 20:27:12,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-02-07 20:27:12,010 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 36 states have internal predecessors, (87), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 108 [2025-02-07 20:27:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:12,011 INFO L225 Difference]: With dead ends: 250 [2025-02-07 20:27:12,011 INFO L226 Difference]: Without dead ends: 240 [2025-02-07 20:27:12,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4309 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1978, Invalid=12784, Unknown=0, NotChecked=0, Total=14762 [2025-02-07 20:27:12,014 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 293 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:12,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 79 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:27:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-07 20:27:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2025-02-07 20:27:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.1210526315789473) internal successors, (213), 190 states have internal predecessors, (213), 25 states have call successors, (25), 22 states have call predecessors, (25), 21 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 20:27:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 262 transitions. [2025-02-07 20:27:12,056 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 262 transitions. Word has length 108 [2025-02-07 20:27:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:12,056 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 262 transitions. [2025-02-07 20:27:12,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 36 states have internal predecessors, (87), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-07 20:27:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 262 transitions. [2025-02-07 20:27:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 20:27:12,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:12,057 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:12,064 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-02-07 20:27:12,257 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,SelfDestructingSolverStorable11 [2025-02-07 20:27:12,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:12,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash 609223057, now seen corresponding path program 1 times [2025-02-07 20:27:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:12,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-02-07 20:27:12,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:27:12,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:12,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 20:27:12,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 20:27:12,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:27:12,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-07 20:27:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:27:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-02-07 20:27:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682809729] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:27:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404307977] [2025-02-07 20:27:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:27:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:12,589 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-02-07 20:27:12,591 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-02-07 20:27:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 20:27:12,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 20:27:12,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:27:12,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:12,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-07 20:27:12,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:27:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:27:12,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-07 20:27:13,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404307977] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:13,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:27:13,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 30 [2025-02-07 20:27:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364457345] [2025-02-07 20:27:13,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:13,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:27:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:13,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:27:13,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2025-02-07 20:27:13,057 INFO L87 Difference]: Start difference. First operand 237 states and 262 transitions. Second operand has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2025-02-07 20:27:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:13,503 INFO L93 Difference]: Finished difference Result 506 states and 569 transitions. [2025-02-07 20:27:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-07 20:27:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 118 [2025-02-07 20:27:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:13,506 INFO L225 Difference]: With dead ends: 506 [2025-02-07 20:27:13,506 INFO L226 Difference]: Without dead ends: 500 [2025-02-07 20:27:13,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=966, Invalid=1686, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 20:27:13,511 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:13,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 240 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:27:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-07 20:27:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2025-02-07 20:27:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 398 states have (on average 1.1231155778894473) internal successors, (447), 398 states have internal predecessors, (447), 51 states have call successors, (51), 48 states have call predecessors, (51), 47 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-07 20:27:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 548 transitions. [2025-02-07 20:27:13,595 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 548 transitions. Word has length 118 [2025-02-07 20:27:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:13,596 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 548 transitions. [2025-02-07 20:27:13,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2025-02-07 20:27:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 548 transitions. [2025-02-07 20:27:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-07 20:27:13,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:13,598 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:13,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-07 20:27:13,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:13,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:13,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1389057820, now seen corresponding path program 2 times [2025-02-07 20:27:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:13,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951930223] [2025-02-07 20:27:13,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:27:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:13,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-02-07 20:27:13,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-02-07 20:27:13,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:27:13,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-07 20:27:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:27:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951930223] [2025-02-07 20:27:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951930223] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:27:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908744898] [2025-02-07 20:27:14,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:27:14,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:14,791 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-02-07 20:27:14,793 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-02-07 20:27:14,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 2 equivalence classes. [2025-02-07 20:27:14,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 248 of 248 statements. [2025-02-07 20:27:14,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:27:14,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:14,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-07 20:27:14,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:27:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:27:15,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-07 20:27:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908744898] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:16,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:27:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 28] total 57 [2025-02-07 20:27:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678167550] [2025-02-07 20:27:16,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:16,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-07 20:27:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:16,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-07 20:27:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1466, Invalid=1726, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 20:27:16,021 INFO L87 Difference]: Start difference. First operand 497 states and 548 transitions. Second operand has 57 states, 57 states have (on average 5.7894736842105265) internal successors, (330), 57 states have internal predecessors, (330), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2025-02-07 20:27:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:17,170 INFO L93 Difference]: Finished difference Result 1026 states and 1154 transitions. [2025-02-07 20:27:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-02-07 20:27:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.7894736842105265) internal successors, (330), 57 states have internal predecessors, (330), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 248 [2025-02-07 20:27:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:17,174 INFO L225 Difference]: With dead ends: 1026 [2025-02-07 20:27:17,175 INFO L226 Difference]: Without dead ends: 1020 [2025-02-07 20:27:17,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4035, Invalid=6885, Unknown=0, NotChecked=0, Total=10920 [2025-02-07 20:27:17,178 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 445 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:17,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 404 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:27:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-02-07 20:27:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1017. [2025-02-07 20:27:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 814 states have (on average 1.124078624078624) internal successors, (915), 814 states have internal predecessors, (915), 103 states have call successors, (103), 100 states have call predecessors, (103), 99 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-07 20:27:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1120 transitions. [2025-02-07 20:27:17,319 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1120 transitions. Word has length 248 [2025-02-07 20:27:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:17,320 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1120 transitions. [2025-02-07 20:27:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.7894736842105265) internal successors, (330), 57 states have internal predecessors, (330), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2025-02-07 20:27:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1120 transitions. [2025-02-07 20:27:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-02-07 20:27:17,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:17,326 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:17,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-07 20:27:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:17,530 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 287833586, now seen corresponding path program 3 times [2025-02-07 20:27:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530993365] [2025-02-07 20:27:17,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:27:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:17,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 508 statements into 51 equivalence classes. [2025-02-07 20:27:17,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 508 of 508 statements. [2025-02-07 20:27:17,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-02-07 20:27:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:27:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777187217] [2025-02-07 20:27:17,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:27:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:17,768 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-02-07 20:27:17,770 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-02-07 20:27:17,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 508 statements into 51 equivalence classes. [2025-02-07 20:27:18,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 508 of 508 statements. [2025-02-07 20:27:18,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-02-07 20:27:18,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:27:18,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:27:18,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-02-07 20:27:18,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-02-07 20:27:18,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:27:18,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:27:18,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:27:18,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:27:18,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:27:18,385 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-02-07 20:27:18,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-07 20:27:18,577 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:18,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:27:18,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:27:18 BoogieIcfgContainer [2025-02-07 20:27:18,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:27:18,684 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:27:18,684 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:27:18,684 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:27:18,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:26:53" (3/4) ... [2025-02-07 20:27:18,685 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:27:18,789 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 355. [2025-02-07 20:27:18,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:27:18,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:27:18,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:27:18,908 INFO L158 Benchmark]: Toolchain (without parser) took 26264.65ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.8MB in the beginning and 162.3MB in the end (delta: -50.5MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2025-02-07 20:27:18,908 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:27:18,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.51ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:27:18,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.34ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 994.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:27:18,909 INFO L158 Benchmark]: Boogie Preprocessor took 23.03ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.5MB in the end (delta: 850.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:27:18,909 INFO L158 Benchmark]: IcfgBuilder took 205.38ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 86.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:27:18,909 INFO L158 Benchmark]: TraceAbstraction took 25585.56ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 86.1MB in the beginning and 195.9MB in the end (delta: -109.7MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2025-02-07 20:27:18,909 INFO L158 Benchmark]: Witness Printer took 223.59ms. Allocated memory is still 268.4MB. Free memory was 195.9MB in the beginning and 162.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 20:27:18,910 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.55ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.51ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 100.3MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.34ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.3MB in the end (delta: 994.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.03ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.5MB in the end (delta: 850.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 205.38ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 86.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25585.56ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 86.1MB in the beginning and 195.9MB in the end (delta: -109.7MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. * Witness Printer took 223.59ms. Allocated memory is still 268.4MB. Free memory was 195.9MB in the beginning and 162.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=100, Y=1, counter=0, v=-98, x=0, y=0] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=1, v=-98, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=1, v=-98, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=1, v=-98, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=1, v=-98, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=1, v=-96, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=100, Y=1, counter=1, v=-96, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=2, v=-96, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=2, v=-96, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=2, v=-96, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=2, v=-96, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=2, v=-94, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=100, Y=1, counter=2, v=-94, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=3, v=-94, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=3, v=-94, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=3, v=-94, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=3, v=-94, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=3, v=-92, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=100, Y=1, counter=3, v=-92, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=4, v=-92, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=4, v=-92, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=4, v=-92, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=4, v=-92, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=4, v=-90, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=100, Y=1, counter=4, v=-90, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=5, v=-90, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=5, v=-90, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=5, v=-90, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=5, v=-90, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=5, v=-88, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=100, Y=1, counter=5, v=-88, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=6, v=-88, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=6, v=-88, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=6, v=-88, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=6, v=-88, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=6, v=-86, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=100, Y=1, counter=6, v=-86, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=7, v=-86, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=7, v=-86, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=7, v=-86, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=7, v=-86, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=7, v=-84, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=100, Y=1, counter=7, v=-84, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=8, v=-84, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=8, v=-84, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=8, v=-84, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=8, v=-84, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=8, v=-82, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=100, Y=1, counter=8, v=-82, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=9, v=-82, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=9, v=-82, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=9, v=-82, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=9, v=-82, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=9, v=-80, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=100, Y=1, counter=9, v=-80, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=10, v=-80, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=10, v=-80, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=10, v=-80, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=10, v=-80, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=10, v=-78, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=100, Y=1, counter=10, v=-78, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=11, v=-78, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=11, v=-78, x=10, xy=0, y=0, yx=10] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=11, v=-78, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=11, v=-78, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=11, v=-76, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=100, Y=1, counter=11, v=-76, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=12, v=-76, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=12, v=-76, x=11, xy=0, y=0, yx=11] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=12, v=-76, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=12, v=-76, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=12, v=-74, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=100, Y=1, counter=12, v=-74, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=13, v=-74, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=13, v=-74, x=12, xy=0, y=0, yx=12] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=13, v=-74, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=13, v=-74, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=13, v=-72, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=100, Y=1, counter=13, v=-72, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=14, v=-72, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=14, v=-72, x=13, xy=0, y=0, yx=13] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=14, v=-72, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=14, v=-72, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=14, v=-70, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=100, Y=1, counter=14, v=-70, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=15, v=-70, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=15, v=-70, x=14, xy=0, y=0, yx=14] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=15, v=-70, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=15, v=-70, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=15, v=-68, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=100, Y=1, counter=15, v=-68, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=16, v=-68, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=16, v=-68, x=15, xy=0, y=0, yx=15] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=16, v=-68, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=16, v=-68, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=16, v=-66, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=100, Y=1, counter=16, v=-66, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=17, v=-66, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=17, v=-66, x=16, xy=0, y=0, yx=16] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=17, v=-66, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=17, v=-66, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=17, v=-64, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=100, Y=1, counter=17, v=-64, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=18, v=-64, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=18, v=-64, x=17, xy=0, y=0, yx=17] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=18, v=-64, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=18, v=-64, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=18, v=-62, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=100, Y=1, counter=18, v=-62, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=19, v=-62, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=19, v=-62, x=18, xy=0, y=0, yx=18] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=19, v=-62, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=19, v=-62, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=19, v=-60, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=100, Y=1, counter=19, v=-60, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=20, v=-60, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=20, v=-60, x=19, xy=0, y=0, yx=19] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=20, v=-60, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=20, v=-60, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=20, v=-58, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=100, Y=1, counter=20, v=-58, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=21, v=-58, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=21, v=-58, x=20, xy=0, y=0, yx=20] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=21, v=-58, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=21, v=-58, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=21, v=-56, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=100, Y=1, counter=21, v=-56, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=22, v=-56, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=22, v=-56, x=21, xy=0, y=0, yx=21] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=22, v=-56, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=22, v=-56, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=22, v=-54, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=100, Y=1, counter=22, v=-54, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=23, v=-54, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=23, v=-54, x=22, xy=0, y=0, yx=22] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=23, v=-54, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=23, v=-54, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=23, v=-52, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=100, Y=1, counter=23, v=-52, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=24, v=-52, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=24, v=-52, x=23, xy=0, y=0, yx=23] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=24, v=-52, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=24, v=-52, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=24, v=-50, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=100, Y=1, counter=24, v=-50, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=25, v=-50, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=25, v=-50, x=24, xy=0, y=0, yx=24] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=25, v=-50, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=25, v=-50, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=25, v=-48, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=100, Y=1, counter=25, v=-48, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=26, v=-48, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=26, v=-48, x=25, xy=0, y=0, yx=25] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=26, v=-48, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=26, v=-48, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=26, v=-46, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=100, Y=1, counter=26, v=-46, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=27, v=-46, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=27, v=-46, x=26, xy=0, y=0, yx=26] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=27, v=-46, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=27, v=-46, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=27, v=-44, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=100, Y=1, counter=27, v=-44, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=28, v=-44, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=28, v=-44, x=27, xy=0, y=0, yx=27] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=28, v=-44, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=28, v=-44, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=28, v=-42, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=100, Y=1, counter=28, v=-42, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=29, v=-42, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=29, v=-42, x=28, xy=0, y=0, yx=28] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=29, v=-42, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=29, v=-42, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=29, v=-40, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=100, Y=1, counter=29, v=-40, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=30, v=-40, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=30, v=-40, x=29, xy=0, y=0, yx=29] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=30, v=-40, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=30, v=-40, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=30, v=-38, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=100, Y=1, counter=30, v=-38, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=31, v=-38, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=31, v=-38, x=30, xy=0, y=0, yx=30] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=31, v=-38, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=31, v=-38, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=31, v=-36, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=100, Y=1, counter=31, v=-36, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=32, v=-36, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=32, v=-36, x=31, xy=0, y=0, yx=31] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=32, v=-36, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=32, v=-36, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=32, v=-34, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=100, Y=1, counter=32, v=-34, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=33, v=-34, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=33, v=-34, x=32, xy=0, y=0, yx=32] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=33, v=-34, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=33, v=-34, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=33, v=-32, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=100, Y=1, counter=33, v=-32, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=34, v=-32, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=34, v=-32, x=33, xy=0, y=0, yx=33] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=34, v=-32, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=34, v=-32, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=34, v=-30, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=100, Y=1, counter=34, v=-30, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=35, v=-30, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=35, v=-30, x=34, xy=0, y=0, yx=34] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=35, v=-30, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=35, v=-30, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=35, v=-28, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=100, Y=1, counter=35, v=-28, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=36, v=-28, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=36, v=-28, x=35, xy=0, y=0, yx=35] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=36, v=-28, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=36, v=-28, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=36, v=-26, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=100, Y=1, counter=36, v=-26, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=37, v=-26, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=37, v=-26, x=36, xy=0, y=0, yx=36] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=37, v=-26, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=37, v=-26, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=37, v=-24, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=100, Y=1, counter=37, v=-24, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=38, v=-24, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=38, v=-24, x=37, xy=0, y=0, yx=37] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=38, v=-24, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=38, v=-24, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=38, v=-22, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=100, Y=1, counter=38, v=-22, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=39, v=-22, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=39, v=-22, x=38, xy=0, y=0, yx=38] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=39, v=-22, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=39, v=-22, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=39, v=-20, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=100, Y=1, counter=39, v=-20, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=40, v=-20, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=40, v=-20, x=39, xy=0, y=0, yx=39] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=40, v=-20, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=40, v=-20, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=40, v=-18, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=100, Y=1, counter=40, v=-18, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=41, v=-18, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=41, v=-18, x=40, xy=0, y=0, yx=40] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=41, v=-18, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=41, v=-18, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=41, v=-16, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=100, Y=1, counter=41, v=-16, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=42, v=-16, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=42, v=-16, x=41, xy=0, y=0, yx=41] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=42, v=-16, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=42, v=-16, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=42, v=-14, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=100, Y=1, counter=42, v=-14, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=43, v=-14, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=43, v=-14, x=42, xy=0, y=0, yx=42] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=43, v=-14, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=43, v=-14, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=43, v=-12, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=100, Y=1, counter=43, v=-12, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=44, v=-12, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=44, v=-12, x=43, xy=0, y=0, yx=43] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=44, v=-12, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=44, v=-12, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=44, v=-10, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=100, Y=1, counter=44, v=-10, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=45, v=-10, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=45, v=-10, x=44, xy=0, y=0, yx=44] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=45, v=-10, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=45, v=-10, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=45, v=-8, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=100, Y=1, counter=45, v=-8, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=46, v=-8, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=46, v=-8, x=45, xy=0, y=0, yx=45] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=46, v=-8, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=46, v=-8, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=46, v=-6, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=100, Y=1, counter=46, v=-6, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=47, v=-6, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=47, v=-6, x=46, xy=0, y=0, yx=46] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=47, v=-6, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=47, v=-6, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=47, v=-4, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=100, Y=1, counter=47, v=-4, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=48, v=-4, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=48, v=-4, x=47, xy=0, y=0, yx=47] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=48, v=-4, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=48, v=-4, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=48, v=-2, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=100, Y=1, counter=48, v=-2, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=49, v=-2, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=49, v=-2, x=48, xy=0, y=0, yx=48] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=49, v=-2, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=49, v=-2, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=49, v=0, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=100, Y=1, counter=49, v=0, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=50, v=0, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=50, v=0, x=49, xy=0, y=0, yx=49] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=50, v=0, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=50, v=0, x=49, xy=0, y=0, yx=49] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=100, Y=1, counter=50, v=-198, x=49, xy=0, y=1, yx=49] [L45] x++ VAL [X=100, Y=1, counter=50, v=-198, x=50, xy=0, y=1, yx=49] [L31] COND TRUE counter++<50 [L31] EXPR counter++ VAL [X=100, Y=1, counter=51, v=-198, x=50, xy=0, y=1, yx=49] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=100, Y=1, counter=51, v=-198, xy=50, y=1, yx=50] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 15, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1078 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1073 mSDsluCounter, 1762 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1568 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1994 IncrementalHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 194 mSDtfsCounter, 1994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1797 GetRequests, 1329 SyntacticMatches, 13 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7990 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1017occurred in iteration=14, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 92 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2540 NumberOfCodeBlocks, 2430 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 2142 ConstructedInterpolants, 6 QuantifiedInterpolants, 7411 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1981 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 4491/12678 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-02-07 20:27:18,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE