./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-551b009-m [2025-01-09 03:10:10,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:10:10,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:10:10,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:10:10,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:10:10,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:10:10,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:10:10,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:10:10,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:10:10,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:10:10,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:10:10,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:10:10,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:10:10,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:10:10,489 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:10:10,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:10:10,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:10:10,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:10:10,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:10:10,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:10:10,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:10:10,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:10:10,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:10:10,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:10:10,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:10,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:10:10,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:10,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:10:10,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:10:10,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:10:10,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:10:10,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:10:10,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:10:10,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:10:10,493 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-01-09 03:10:10,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:10:10,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:10:10,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:10:10,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:10:10,822 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:10:10,823 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-01-09 03:10:12,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b28dcd3e0/03b72594185944969b7d93c1f1e20619/FLAGb167885aa [2025-01-09 03:10:12,404 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:10:12,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2025-01-09 03:10:12,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b28dcd3e0/03b72594185944969b7d93c1f1e20619/FLAGb167885aa [2025-01-09 03:10:12,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b28dcd3e0/03b72594185944969b7d93c1f1e20619 [2025-01-09 03:10:12,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:10:12,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:10:12,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:10:12,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:10:12,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:10:12,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b24bc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12, skipping insertion in model container [2025-01-09 03:10:12,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:10:12,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2025-01-09 03:10:12,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:10:12,597 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:10:12,608 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-01-09 03:10:12,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:10:12,627 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:10:12,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12 WrapperNode [2025-01-09 03:10:12,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:10:12,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:10:12,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:10:12,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:10:12,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,656 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-01-09 03:10:12,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:10:12,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:10:12,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:10:12,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:10:12,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:10:12,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:10:12,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:10:12,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:10:12,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:10:12,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (1/1) ... [2025-01-09 03:10:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:12,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:10:12,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:10:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:10:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:10:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:10:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:10:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:10:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:10:12,800 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:10:12,801 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:10:12,951 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-01-09 03:10:12,952 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:10:12,961 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:10:12,962 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:10:12,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:12 BoogieIcfgContainer [2025-01-09 03:10:12,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:10:12,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:10:12,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:10:12,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:10:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:12" (1/3) ... [2025-01-09 03:10:12,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7632c22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:12, skipping insertion in model container [2025-01-09 03:10:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:12" (2/3) ... [2025-01-09 03:10:12,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7632c22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:12, skipping insertion in model container [2025-01-09 03:10:12,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:12" (3/3) ... [2025-01-09 03:10:12,971 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2025-01-09 03:10:12,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:10:12,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound50.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:10:13,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:10:13,053 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;@44f2d05a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:10:13,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:10:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-01-09 03:10:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:10:13,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:13,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:13,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:13,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 798370362, now seen corresponding path program 1 times [2025-01-09 03:10:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:13,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854354844] [2025-01-09 03:10:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:13,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:10:13,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:10:13,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:13,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854354844] [2025-01-09 03:10:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854354844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:10:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596820968] [2025-01-09 03:10:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:13,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:10:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:13,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:10:13,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:10:13,227 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:10:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:13,244 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-01-09 03:10:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:10:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 03:10:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:13,250 INFO L225 Difference]: With dead ends: 40 [2025-01-09 03:10:13,251 INFO L226 Difference]: Without dead ends: 17 [2025-01-09 03:10:13,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:10:13,259 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:13,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-09 03:10:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-09 03:10:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:10:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-01-09 03:10:13,290 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2025-01-09 03:10:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-01-09 03:10:13,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:10:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-01-09 03:10:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:10:13,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:13,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:13,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:10:13,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash 295298814, now seen corresponding path program 1 times [2025-01-09 03:10:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503194401] [2025-01-09 03:10:13,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:13,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:10:13,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:10:13,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:13,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017507427] [2025-01-09 03:10:13,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:13,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:13,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:13,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:13,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:10:13,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:10:13,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:10:13,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:13,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:13,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:10:13,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:13,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:13,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503194401] [2025-01-09 03:10:13,585 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017507427] [2025-01-09 03:10:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017507427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:13,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:10:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564862631] [2025-01-09 03:10:13,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:13,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:10:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:13,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:10:13,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:13,588 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:10:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:13,681 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-01-09 03:10:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:10:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2025-01-09 03:10:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:13,683 INFO L225 Difference]: With dead ends: 32 [2025-01-09 03:10:13,683 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 03:10:13,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-01-09 03:10:13,684 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:13,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 03:10:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-01-09 03:10:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 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-01-09 03:10:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-01-09 03:10:13,691 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2025-01-09 03:10:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:13,691 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-09 03:10:13,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:10:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-01-09 03:10:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:10:13,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:13,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:13,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:10:13,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:13,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:13,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 368316555, now seen corresponding path program 1 times [2025-01-09 03:10:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104972599] [2025-01-09 03:10:13,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:13,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:10:13,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:10:13,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:13,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:13,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104972599] [2025-01-09 03:10:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104972599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:13,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:13,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:10:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825909822] [2025-01-09 03:10:13,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:13,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:10:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:13,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:10:13,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:10:13,995 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:10:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:14,018 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-09 03:10:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:10:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-01-09 03:10:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:14,020 INFO L225 Difference]: With dead ends: 33 [2025-01-09 03:10:14,020 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 03:10:14,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:10:14,021 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 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-01-09 03:10:14,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 03:10:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-09 03:10:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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-01-09 03:10:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-01-09 03:10:14,028 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2025-01-09 03:10:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:14,028 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-09 03:10:14,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:10:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-01-09 03:10:14,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 03:10:14,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:14,029 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:14,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:10:14,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:14,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash -156697420, now seen corresponding path program 1 times [2025-01-09 03:10:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075113544] [2025-01-09 03:10:14,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:14,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:10:14,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:10:14,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:14,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104481891] [2025-01-09 03:10:14,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:14,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:14,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:14,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:14,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:10:14,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:10:14,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:10:14,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:14,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:14,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:10:14,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:14,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:14,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075113544] [2025-01-09 03:10:14,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104481891] [2025-01-09 03:10:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104481891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:10:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743103736] [2025-01-09 03:10:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:14,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:10:14,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:14,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:10:14,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:14,289 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-01-09 03:10:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:14,372 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-01-09 03:10:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:10:14,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2025-01-09 03:10:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:14,373 INFO L225 Difference]: With dead ends: 35 [2025-01-09 03:10:14,374 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 03:10:14,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-01-09 03:10:14,374 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:14,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 03:10:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-01-09 03:10:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 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-01-09 03:10:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-01-09 03:10:14,379 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2025-01-09 03:10:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-01-09 03:10:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-01-09 03:10:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-01-09 03:10:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:10:14,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:14,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:14,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:14,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:14,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:14,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash -716773380, now seen corresponding path program 1 times [2025-01-09 03:10:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:14,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749918900] [2025-01-09 03:10:14,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:14,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:14,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:14,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:14,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433357543] [2025-01-09 03:10:14,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:14,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:14,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:14,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:10:14,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:14,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:14,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:14,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:14,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 03:10:14,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:14,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 03:10:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749918900] [2025-01-09 03:10:14,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433357543] [2025-01-09 03:10:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433357543] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:14,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-01-09 03:10:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353205359] [2025-01-09 03:10:14,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:14,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:10:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:14,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:10:14,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:10:14,963 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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-01-09 03:10:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:15,184 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-01-09 03:10:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:10:15,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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 20 [2025-01-09 03:10:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:15,185 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:10:15,186 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 03:10:15,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:10:15,188 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:15,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 03:10:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2025-01-09 03:10:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-01-09 03:10:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-01-09 03:10:15,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2025-01-09 03:10:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:15,203 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-01-09 03:10:15,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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-01-09 03:10:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-01-09 03:10:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:10:15,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:15,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:15,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:10:15,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:15,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:15,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash -643755639, now seen corresponding path program 1 times [2025-01-09 03:10:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:15,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350632317] [2025-01-09 03:10:15,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:15,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:15,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:15,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:15,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350632317] [2025-01-09 03:10:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350632317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243634326] [2025-01-09 03:10:15,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:15,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:15,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:15,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:10:15,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:15,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:15,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:15,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:10:15,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:15,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243634326] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:15,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:15,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-01-09 03:10:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418645562] [2025-01-09 03:10:15,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:10:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:15,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:10:15,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:10:15,644 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-01-09 03:10:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:15,725 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-01-09 03:10:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:10:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 20 [2025-01-09 03:10:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:15,726 INFO L225 Difference]: With dead ends: 72 [2025-01-09 03:10:15,726 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 03:10:15,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:10:15,727 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:15,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:10:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 03:10:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2025-01-09 03:10:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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-01-09 03:10:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-01-09 03:10:15,744 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2025-01-09 03:10:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:15,745 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-01-09 03:10:15,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-01-09 03:10:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-01-09 03:10:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 03:10:15,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:15,746 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:15,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:10:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 03:10:15,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:15,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 935756278, now seen corresponding path program 1 times [2025-01-09 03:10:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:15,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906663813] [2025-01-09 03:10:15,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:15,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:15,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268492790] [2025-01-09 03:10:15,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:15,989 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:10:16,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:16,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:16,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:16,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 03:10:16,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:10:16,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:10:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906663813] [2025-01-09 03:10:16,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268492790] [2025-01-09 03:10:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268492790] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:16,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-01-09 03:10:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849183473] [2025-01-09 03:10:16,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:16,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:10:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:16,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:10:16,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:10:16,359 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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-01-09 03:10:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:16,537 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2025-01-09 03:10:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:10:16,537 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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 27 [2025-01-09 03:10:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:16,538 INFO L225 Difference]: With dead ends: 86 [2025-01-09 03:10:16,538 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 03:10:16,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:10:16,539 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:16,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 03:10:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-01-09 03:10:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 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-01-09 03:10:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-01-09 03:10:16,557 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 27 [2025-01-09 03:10:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-01-09 03:10:16,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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-01-09 03:10:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-01-09 03:10:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 03:10:16,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:16,558 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:16,566 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-01-09 03:10:16,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:16,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -85312076, now seen corresponding path program 1 times [2025-01-09 03:10:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914167061] [2025-01-09 03:10:16,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:16,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:16,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:16,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:16,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024745384] [2025-01-09 03:10:16,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:16,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:16,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:16,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:16,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:10:16,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:16,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:16,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:16,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:16,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 03:10:16,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:10:17,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:10:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914167061] [2025-01-09 03:10:17,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:17,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024745384] [2025-01-09 03:10:17,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024745384] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:17,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:17,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-01-09 03:10:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282492205] [2025-01-09 03:10:17,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:17,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 03:10:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:17,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 03:10:17,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:10:17,361 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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-01-09 03:10:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:17,982 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2025-01-09 03:10:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 03:10:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 27 [2025-01-09 03:10:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:17,984 INFO L225 Difference]: With dead ends: 87 [2025-01-09 03:10:17,984 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 03:10:17,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 03:10:17,985 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:17,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 169 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:10:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 03:10:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2025-01-09 03:10:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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-01-09 03:10:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-01-09 03:10:18,007 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2025-01-09 03:10:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-01-09 03:10:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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-01-09 03:10:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-01-09 03:10:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 03:10:18,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:18,008 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:18,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:10:18,209 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,SelfDestructingSolverStorable7 [2025-01-09 03:10:18,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 380685067, now seen corresponding path program 2 times [2025-01-09 03:10:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815088810] [2025-01-09 03:10:18,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:18,217 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 03:10:18,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 03:10:18,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:18,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:10:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815088810] [2025-01-09 03:10:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815088810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060198832] [2025-01-09 03:10:18,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:18,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:18,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:18,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:18,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:10:18,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 03:10:18,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 03:10:18,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:18,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:18,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:10:18,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:18,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:10:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060198832] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:18,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2025-01-09 03:10:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979828917] [2025-01-09 03:10:18,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 03:10:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:18,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 03:10:18,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:10:18,773 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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-01-09 03:10:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:18,952 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2025-01-09 03:10:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:10:18,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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 53 [2025-01-09 03:10:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:18,953 INFO L225 Difference]: With dead ends: 126 [2025-01-09 03:10:18,954 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 03:10:18,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:10:18,955 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:18,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:18,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 03:10:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 03:10:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.1122448979591837) internal successors, (109), 98 states have internal predecessors, (109), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 03:10:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-01-09 03:10:18,987 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 53 [2025-01-09 03:10:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-01-09 03:10:18,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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-01-09 03:10:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-01-09 03:10:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:10:18,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:18,992 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:19,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:19,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1638130997, now seen corresponding path program 3 times [2025-01-09 03:10:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168826411] [2025-01-09 03:10:19,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:19,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-01-09 03:10:19,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:10:19,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 03:10:19,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 20 proven. 335 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 03:10:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168826411] [2025-01-09 03:10:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168826411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541403665] [2025-01-09 03:10:20,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:20,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:20,299 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:20,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:10:20,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-01-09 03:10:20,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 119 statements. [2025-01-09 03:10:20,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:10:20,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:20,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 03:10:20,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 03:10:20,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 03:10:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541403665] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:21,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 12] total 37 [2025-01-09 03:10:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353303918] [2025-01-09 03:10:21,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 03:10:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:21,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 03:10:21,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 03:10:21,227 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 states have internal predecessors, (100), 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-01-09 03:10:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:24,306 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2025-01-09 03:10:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-01-09 03:10:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 states have internal predecessors, (100), 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 119 [2025-01-09 03:10:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:24,314 INFO L225 Difference]: With dead ends: 254 [2025-01-09 03:10:24,314 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 03:10:24,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4856 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2195, Invalid=13555, Unknown=0, NotChecked=0, Total=15750 [2025-01-09 03:10:24,319 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 251 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:24,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 127 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:10:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 03:10:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2025-01-09 03:10:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 197 states have (on average 1.1116751269035532) internal successors, (219), 197 states have internal predecessors, (219), 22 states have call successors, (22), 22 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 03:10:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2025-01-09 03:10:24,359 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 119 [2025-01-09 03:10:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:24,359 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2025-01-09 03:10:24,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 states have internal predecessors, (100), 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-01-09 03:10:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2025-01-09 03:10:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:10:24,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:24,362 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:24,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 03:10:24,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:24,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:24,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2053046965, now seen corresponding path program 1 times [2025-01-09 03:10:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064160559] [2025-01-09 03:10:24,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:24,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:10:24,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:10:24,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:24,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:10:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064160559] [2025-01-09 03:10:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064160559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616765061] [2025-01-09 03:10:25,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:25,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:25,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:25,016 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:25,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:10:25,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:10:25,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:10:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:25,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 03:10:25,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:25,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 03:10:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616765061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:25,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:25,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2025-01-09 03:10:25,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659172614] [2025-01-09 03:10:25,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:25,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:10:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:10:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:10:25,618 INFO L87 Difference]: Start difference. First operand 241 states and 262 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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-01-09 03:10:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:26,095 INFO L93 Difference]: Finished difference Result 536 states and 595 transitions. [2025-01-09 03:10:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 03:10:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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 130 [2025-01-09 03:10:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:26,099 INFO L225 Difference]: With dead ends: 536 [2025-01-09 03:10:26,099 INFO L226 Difference]: Without dead ends: 530 [2025-01-09 03:10:26,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 03:10:26,101 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 143 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:26,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 266 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:26,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-01-09 03:10:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2025-01-09 03:10:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 431 states have (on average 1.111368909512761) internal successors, (479), 431 states have internal predecessors, (479), 48 states have call successors, (48), 48 states have call predecessors, (48), 47 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:10:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 574 transitions. [2025-01-09 03:10:26,193 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 574 transitions. Word has length 130 [2025-01-09 03:10:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:26,193 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 574 transitions. [2025-01-09 03:10:26,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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-01-09 03:10:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 574 transitions. [2025-01-09 03:10:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-09 03:10:26,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:26,202 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:26,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 03:10:26,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:26,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:26,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 182128013, now seen corresponding path program 2 times [2025-01-09 03:10:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134992489] [2025-01-09 03:10:26,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:26,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-01-09 03:10:26,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 03:10:26,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:26,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 03:10:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134992489] [2025-01-09 03:10:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134992489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147542592] [2025-01-09 03:10:27,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:27,899 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:27,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 03:10:27,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-01-09 03:10:28,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 273 of 273 statements. [2025-01-09 03:10:28,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:28,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:28,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 03:10:28,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 3084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:10:28,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 03:10:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147542592] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:29,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:29,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 55 [2025-01-09 03:10:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171675385] [2025-01-09 03:10:29,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:29,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-09 03:10:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:29,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-09 03:10:29,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=1609, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 03:10:29,409 INFO L87 Difference]: Start difference. First operand 527 states and 574 transitions. Second operand has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 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-01-09 03:10:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:30,788 INFO L93 Difference]: Finished difference Result 1108 states and 1232 transitions. [2025-01-09 03:10:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-01-09 03:10:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 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 273 [2025-01-09 03:10:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:30,802 INFO L225 Difference]: With dead ends: 1108 [2025-01-09 03:10:30,802 INFO L226 Difference]: Without dead ends: 1102 [2025-01-09 03:10:30,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2025-01-09 03:10:30,808 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 322 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:30,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 469 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:10:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-01-09 03:10:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1099. [2025-01-09 03:10:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 899 states have (on average 1.1112347052280311) internal successors, (999), 899 states have internal predecessors, (999), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 03:10:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1198 transitions. [2025-01-09 03:10:30,936 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1198 transitions. Word has length 273 [2025-01-09 03:10:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:30,937 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1198 transitions. [2025-01-09 03:10:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 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-01-09 03:10:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1198 transitions. [2025-01-09 03:10:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-01-09 03:10:30,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:30,946 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:30,956 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-01-09 03:10:31,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 03:10:31,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:31,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1615446477, now seen corresponding path program 3 times [2025-01-09 03:10:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360551405] [2025-01-09 03:10:31,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:31,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 559 statements into 51 equivalence classes. [2025-01-09 03:10:31,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 03:10:31,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-01-09 03:10:31,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579068805] [2025-01-09 03:10:31,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:31,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:31,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:31,633 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:10:31,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 03:10:31,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 559 statements into 51 equivalence classes. [2025-01-09 03:10:31,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 03:10:31,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-01-09 03:10:31,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:10:31,976 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:10:32,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 03:10:32,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 03:10:32,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:32,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:10:32,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:10:32,298 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:10:32,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:10:32,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 03:10:32,501 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,SelfDestructingSolverStorable12 [2025-01-09 03:10:32,504 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:32,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:10:32,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:10:32 BoogieIcfgContainer [2025-01-09 03:10:32,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:10:32,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:10:32,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:10:32,657 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:10:32,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:12" (3/4) ... [2025-01-09 03:10:32,659 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:10:32,826 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 304. [2025-01-09 03:10:33,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:10:33,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:10:33,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:10:33,004 INFO L158 Benchmark]: Toolchain (without parser) took 20575.28ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 105.6MB in the beginning and 356.5MB in the end (delta: -250.9MB). Peak memory consumption was 235.9MB. Max. memory is 16.1GB. [2025-01-09 03:10:33,004 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:33,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.99ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.5MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:10:33,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.49ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:33,005 INFO L158 Benchmark]: Boogie Preprocessor took 23.12ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:10:33,005 INFO L158 Benchmark]: RCFGBuilder took 281.04ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 80.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:10:33,006 INFO L158 Benchmark]: TraceAbstraction took 19689.16ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 80.8MB in the beginning and 169.9MB in the end (delta: -89.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2025-01-09 03:10:33,006 INFO L158 Benchmark]: Witness Printer took 348.41ms. Allocated memory is still 402.7MB. Free memory was 169.9MB in the beginning and 356.5MB in the end (delta: -186.6MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2025-01-09 03:10:33,007 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.34ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.99ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 94.5MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.49ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.12ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 281.04ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 80.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19689.16ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 80.8MB in the beginning and 169.9MB in the end (delta: -89.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. * Witness Printer took 348.41ms. Allocated memory is still 402.7MB. Free memory was 169.9MB in the beginning and 356.5MB in the end (delta: -186.6MB). Peak memory consumption was 39.9MB. 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; VAL [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=197, Y=2, counter=0, v=-193, x=0, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=1, v=-193, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=1, v=-193, 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=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=1, v=-189, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=197, Y=2, counter=1, v=-189, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=2, v=-189, 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=197, Y=2, counter=2, v=-189, x=1, 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=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=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=2, v=-185, x=1, xy=0, y=0, yx=2] [L45] x++ VAL [X=197, Y=2, counter=2, v=-185, x=2, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=197, Y=2, counter=3, v=-185, x=2, 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=197, Y=2, counter=3, v=-185, x=2, 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=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=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=3, v=-181, x=2, xy=0, y=0, yx=4] [L45] x++ VAL [X=197, Y=2, counter=3, v=-181, x=3, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=197, Y=2, counter=4, v=-181, x=3, 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=197, Y=2, counter=4, v=-181, x=3, 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=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=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=4, v=-177, x=3, xy=0, y=0, yx=6] [L45] x++ VAL [X=197, Y=2, counter=4, v=-177, x=4, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=197, Y=2, counter=5, v=-177, x=4, 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=197, Y=2, counter=5, v=-177, x=4, 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=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=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=5, v=-173, x=4, xy=0, y=0, yx=8] [L45] x++ VAL [X=197, Y=2, counter=5, v=-173, x=5, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=197, Y=2, counter=6, v=-173, x=5, 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=197, Y=2, counter=6, v=-173, x=5, 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=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=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=6, v=-169, x=5, xy=0, y=0, yx=10] [L45] x++ VAL [X=197, Y=2, counter=6, v=-169, x=6, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=197, Y=2, counter=7, v=-169, x=6, 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=197, Y=2, counter=7, v=-169, x=6, 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=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=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=7, v=-165, x=6, xy=0, y=0, yx=12] [L45] x++ VAL [X=197, Y=2, counter=7, v=-165, x=7, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=197, Y=2, counter=8, v=-165, x=7, 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=197, Y=2, counter=8, v=-165, x=7, 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=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=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=8, v=-161, x=7, xy=0, y=0, yx=14] [L45] x++ VAL [X=197, Y=2, counter=8, v=-161, x=8, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=197, Y=2, counter=9, v=-161, x=8, 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=197, Y=2, counter=9, v=-161, x=8, 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=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=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=9, v=-157, x=8, xy=0, y=0, yx=16] [L45] x++ VAL [X=197, Y=2, counter=9, v=-157, x=9, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=197, Y=2, counter=10, v=-157, x=9, 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=197, Y=2, counter=10, v=-157, x=9, 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=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=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=10, v=-153, x=9, xy=0, y=0, yx=18] [L45] x++ VAL [X=197, Y=2, counter=10, v=-153, x=10, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=197, Y=2, counter=11, v=-153, x=10, 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=197, Y=2, counter=11, v=-153, x=10, 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=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=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=11, v=-149, x=10, xy=0, y=0, yx=20] [L45] x++ VAL [X=197, Y=2, counter=11, v=-149, x=11, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=197, Y=2, counter=12, v=-149, x=11, 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=197, Y=2, counter=12, v=-149, x=11, 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=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=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=12, v=-145, x=11, xy=0, y=0, yx=22] [L45] x++ VAL [X=197, Y=2, counter=12, v=-145, x=12, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=197, Y=2, counter=13, v=-145, x=12, 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=197, Y=2, counter=13, v=-145, x=12, 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=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=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=13, v=-141, x=12, xy=0, y=0, yx=24] [L45] x++ VAL [X=197, Y=2, counter=13, v=-141, x=13, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=197, Y=2, counter=14, v=-141, x=13, 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=197, Y=2, counter=14, v=-141, x=13, 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=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=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=14, v=-137, x=13, xy=0, y=0, yx=26] [L45] x++ VAL [X=197, Y=2, counter=14, v=-137, x=14, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=197, Y=2, counter=15, v=-137, x=14, 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=197, Y=2, counter=15, v=-137, x=14, 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=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=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=15, v=-133, x=14, xy=0, y=0, yx=28] [L45] x++ VAL [X=197, Y=2, counter=15, v=-133, x=15, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=197, Y=2, counter=16, v=-133, x=15, 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=197, Y=2, counter=16, v=-133, x=15, 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=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=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=16, v=-129, x=15, xy=0, y=0, yx=30] [L45] x++ VAL [X=197, Y=2, counter=16, v=-129, x=16, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=197, Y=2, counter=17, v=-129, x=16, 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=197, Y=2, counter=17, v=-129, x=16, 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=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=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=17, v=-125, x=16, xy=0, y=0, yx=32] [L45] x++ VAL [X=197, Y=2, counter=17, v=-125, x=17, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=197, Y=2, counter=18, v=-125, x=17, 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=197, Y=2, counter=18, v=-125, x=17, 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=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=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=18, v=-121, x=17, xy=0, y=0, yx=34] [L45] x++ VAL [X=197, Y=2, counter=18, v=-121, x=18, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=197, Y=2, counter=19, v=-121, x=18, 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=197, Y=2, counter=19, v=-121, x=18, 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=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=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=19, v=-117, x=18, xy=0, y=0, yx=36] [L45] x++ VAL [X=197, Y=2, counter=19, v=-117, x=19, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=197, Y=2, counter=20, v=-117, x=19, 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=197, Y=2, counter=20, v=-117, x=19, 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=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=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=20, v=-113, x=19, xy=0, y=0, yx=38] [L45] x++ VAL [X=197, Y=2, counter=20, v=-113, x=20, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=197, Y=2, counter=21, v=-113, x=20, 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=197, Y=2, counter=21, v=-113, x=20, 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=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=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=21, v=-109, x=20, xy=0, y=0, yx=40] [L45] x++ VAL [X=197, Y=2, counter=21, v=-109, x=21, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=197, Y=2, counter=22, v=-109, x=21, 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=197, Y=2, counter=22, v=-109, x=21, 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=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=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=22, v=-105, x=21, xy=0, y=0, yx=42] [L45] x++ VAL [X=197, Y=2, counter=22, v=-105, x=22, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=197, Y=2, counter=23, v=-105, x=22, 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=197, Y=2, counter=23, v=-105, x=22, 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=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=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=23, v=-101, x=22, xy=0, y=0, yx=44] [L45] x++ VAL [X=197, Y=2, counter=23, v=-101, x=23, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=197, Y=2, counter=24, v=-101, x=23, 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=197, Y=2, counter=24, v=-101, x=23, 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=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=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=24, v=-97, x=23, xy=0, y=0, yx=46] [L45] x++ VAL [X=197, Y=2, counter=24, v=-97, x=24, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=197, Y=2, counter=25, v=-97, x=24, 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=197, Y=2, counter=25, v=-97, x=24, 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=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=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=25, v=-93, x=24, xy=0, y=0, yx=48] [L45] x++ VAL [X=197, Y=2, counter=25, v=-93, x=25, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=197, Y=2, counter=26, v=-93, x=25, 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=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [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=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=26, v=-89, x=25, xy=0, y=0, yx=50] [L45] x++ VAL [X=197, Y=2, counter=26, v=-89, x=26, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=50] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [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=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=27, v=-85, x=26, xy=0, y=0, yx=52] [L45] x++ VAL [X=197, Y=2, counter=27, v=-85, x=27, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=52] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [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=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=28, v=-81, x=27, xy=0, y=0, yx=54] [L45] x++ VAL [X=197, Y=2, counter=28, v=-81, x=28, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=54] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [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=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=29, v=-77, x=28, xy=0, y=0, yx=56] [L45] x++ VAL [X=197, Y=2, counter=29, v=-77, x=29, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=56] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [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=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=30, v=-73, x=29, xy=0, y=0, yx=58] [L45] x++ VAL [X=197, Y=2, counter=30, v=-73, x=30, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=58] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [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=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=31, v=-69, x=30, xy=0, y=0, yx=60] [L45] x++ VAL [X=197, Y=2, counter=31, v=-69, x=31, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=60] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [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=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=32, v=-65, x=31, xy=0, y=0, yx=62] [L45] x++ VAL [X=197, Y=2, counter=32, v=-65, x=32, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=62] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [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=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=33, v=-61, x=32, xy=0, y=0, yx=64] [L45] x++ VAL [X=197, Y=2, counter=33, v=-61, x=33, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=64] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [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=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=34, v=-57, x=33, xy=0, y=0, yx=66] [L45] x++ VAL [X=197, Y=2, counter=34, v=-57, x=34, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=66] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [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=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=35, v=-53, x=34, xy=0, y=0, yx=68] [L45] x++ VAL [X=197, Y=2, counter=35, v=-53, x=35, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=68] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [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=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=36, v=-49, x=35, xy=0, y=0, yx=70] [L45] x++ VAL [X=197, Y=2, counter=36, v=-49, x=36, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=70] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [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=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=37, v=-45, x=36, xy=0, y=0, yx=72] [L45] x++ VAL [X=197, Y=2, counter=37, v=-45, x=37, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=72] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [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=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=38, v=-41, x=37, xy=0, y=0, yx=74] [L45] x++ VAL [X=197, Y=2, counter=38, v=-41, x=38, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=74] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [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=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=39, v=-37, x=38, xy=0, y=0, yx=76] [L45] x++ VAL [X=197, Y=2, counter=39, v=-37, x=39, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=76] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [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=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=40, v=-33, x=39, xy=0, y=0, yx=78] [L45] x++ VAL [X=197, Y=2, counter=40, v=-33, x=40, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=78] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [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=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=41, v=-29, x=40, xy=0, y=0, yx=80] [L45] x++ VAL [X=197, Y=2, counter=41, v=-29, x=41, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=80] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [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=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=42, v=-25, x=41, xy=0, y=0, yx=82] [L45] x++ VAL [X=197, Y=2, counter=42, v=-25, x=42, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=82] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [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=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=43, v=-21, x=42, xy=0, y=0, yx=84] [L45] x++ VAL [X=197, Y=2, counter=43, v=-21, x=43, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=84] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [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=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=44, v=-17, x=43, xy=0, y=0, yx=86] [L45] x++ VAL [X=197, Y=2, counter=44, v=-17, x=44, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=86] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [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=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=45, v=-13, x=44, xy=0, y=0, yx=88] [L45] x++ VAL [X=197, Y=2, counter=45, v=-13, x=45, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=88] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [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=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=46, v=-9, x=45, xy=0, y=0, yx=90] [L45] x++ VAL [X=197, Y=2, counter=46, v=-9, x=46, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=90] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [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=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=47, v=-5, x=46, xy=0, y=0, yx=92] [L45] x++ VAL [X=197, Y=2, counter=47, v=-5, x=47, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=92] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [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=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=48, v=-1, x=47, xy=0, y=0, yx=94] [L45] x++ VAL [X=197, Y=2, counter=48, v=-1, x=48, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=94] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [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=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=49, v=3, x=48, xy=0, y=0, yx=96] [L45] x++ VAL [X=197, Y=2, counter=49, v=3, x=49, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=96] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [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=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=197, Y=2, counter=50, v=-387, x=49, xy=0, y=1, yx=98] [L45] x++ VAL [X=197, Y=2, counter=50, v=-387, x=50, xy=0, y=1, yx=98] [L31] EXPR counter++ VAL [X=197, Y=2, counter=51, v=-387, x=50, xy=0, y=1, yx=98] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=197, Y=2, counter=51, v=-387, xy=50, y=1, yx=100] [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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 13, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 1593 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1416 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1336 IncrementalHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 177 mSDtfsCounter, 1336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1238 SyntacticMatches, 10 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7654 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred in iteration=12, InterpolantAutomatonStates: 366, 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, 12 MinimizatonAttempts, 66 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2424 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 1950 ConstructedInterpolants, 2 QuantifiedInterpolants, 5829 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 4198/13272 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:10:33,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE