./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.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_unwindbound10.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 d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:09:59,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:09:59,209 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:09:59,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:09:59,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:09:59,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:09:59,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:09:59,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:09:59,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:09:59,228 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:09:59,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:09:59,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:09:59,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:09:59,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:09:59,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:09:59,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:09:59,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:09:59,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:09:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:09:59,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:09:59,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:09:59,231 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 -> d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f [2025-01-09 03:09:59,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:09:59,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:09:59,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:09:59,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:09:59,473 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:09:59,474 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_unwindbound10.c [2025-01-09 03:10:00,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51d074c5e/21fd82f76d984d538824c4d9459054c4/FLAGe76c244c9 [2025-01-09 03:10:00,803 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:10:00,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2025-01-09 03:10:00,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51d074c5e/21fd82f76d984d538824c4d9459054c4/FLAGe76c244c9 [2025-01-09 03:10:01,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51d074c5e/21fd82f76d984d538824c4d9459054c4 [2025-01-09 03:10:01,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:10:01,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:10:01,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:10:01,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:10:01,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:10:01,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:01" (1/1) ... [2025-01-09 03:10:01,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1ee8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:01, skipping insertion in model container [2025-01-09 03:10:01,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:10:01" (1/1) ... [2025-01-09 03:10:01,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:10:01,277 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_unwindbound10.c[597,610] [2025-01-09 03:10:01,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:10:01,301 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:10:01,308 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_unwindbound10.c[597,610] [2025-01-09 03:10:01,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:10:01,326 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:10:01,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:01 WrapperNode [2025-01-09 03:10:01,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:10:01,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:10:01,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:10:01,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:10:01,335 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:01" (1/1) ... [2025-01-09 03:10:01,342 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:01" (1/1) ... [2025-01-09 03:10:01,352 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-01-09 03:10:01,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:10:01,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:10:01,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:10:01,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:10:01,359 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:01" (1/1) ... [2025-01-09 03:10:01,359 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:01" (1/1) ... [2025-01-09 03:10:01,361 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:01" (1/1) ... [2025-01-09 03:10:01,369 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:01,369 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:01" (1/1) ... [2025-01-09 03:10:01,369 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:01" (1/1) ... [2025-01-09 03:10:01,373 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:01" (1/1) ... [2025-01-09 03:10:01,373 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:01" (1/1) ... [2025-01-09 03:10:01,375 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:01" (1/1) ... [2025-01-09 03:10:01,379 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:01" (1/1) ... [2025-01-09 03:10:01,379 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:01" (1/1) ... [2025-01-09 03:10:01,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:10:01,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:10:01,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:10:01,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:10:01,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:01" (1/1) ... [2025-01-09 03:10:01,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:10:01,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:01,413 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:01,416 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:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:10:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:10:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:10:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:10:01,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:10:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:10:01,486 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:10:01,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:10:01,582 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-01-09 03:10:01,582 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:10:01,588 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:10:01,588 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:10:01,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:01 BoogieIcfgContainer [2025-01-09 03:10:01,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:10:01,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:10:01,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:10:01,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:10:01,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:10:01" (1/3) ... [2025-01-09 03:10:01,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3834e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:01, skipping insertion in model container [2025-01-09 03:10:01,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:10:01" (2/3) ... [2025-01-09 03:10:01,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3834e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:10:01, skipping insertion in model container [2025-01-09 03:10:01,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:10:01" (3/3) ... [2025-01-09 03:10:01,595 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2025-01-09 03:10:01,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:10:01,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound10.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:10:01,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:10:01,643 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;@10b98ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:10:01,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:10:01,646 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:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:10:01,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:01,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:01,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash 798370362, now seen corresponding path program 1 times [2025-01-09 03:10:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:01,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048455516] [2025-01-09 03:10:01,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:01,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:10:01,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:10:01,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:01,733 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:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048455516] [2025-01-09 03:10:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048455516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:10:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963565014] [2025-01-09 03:10:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:01,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:10:01,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:01,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:10:01,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:10:01,751 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:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:01,762 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-01-09 03:10:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:10:01,764 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:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:01,768 INFO L225 Difference]: With dead ends: 40 [2025-01-09 03:10:01,768 INFO L226 Difference]: Without dead ends: 17 [2025-01-09 03:10:01,772 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:01,774 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:01,776 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:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-09 03:10:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-09 03:10:01,794 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:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-01-09 03:10:01,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2025-01-09 03:10:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:01,797 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-01-09 03:10:01,797 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:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-01-09 03:10:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:10:01,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:01,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:01,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:10:01,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:01,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 295298814, now seen corresponding path program 1 times [2025-01-09 03:10:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234749659] [2025-01-09 03:10:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:01,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:10:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:10:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972258876] [2025-01-09 03:10:01,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:01,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:01,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:01,818 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:01,819 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:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:10:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:10:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:01,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:01,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:10:01,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:02,015 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:02,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234749659] [2025-01-09 03:10:02,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972258876] [2025-01-09 03:10:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972258876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:10:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900384261] [2025-01-09 03:10:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:10:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:02,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:10:02,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:02,018 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:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:02,095 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-01-09 03:10:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:10:02,095 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:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:02,096 INFO L225 Difference]: With dead ends: 32 [2025-01-09 03:10:02,096 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 03:10:02,097 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:02,097 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:02,097 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.0s Time] [2025-01-09 03:10:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 03:10:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-01-09 03:10:02,101 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:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-01-09 03:10:02,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2025-01-09 03:10:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:02,102 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-01-09 03:10:02,102 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:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-01-09 03:10:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:10:02,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:02,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:02,110 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:02,303 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:02,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:02,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash 368316555, now seen corresponding path program 1 times [2025-01-09 03:10:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:02,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69125952] [2025-01-09 03:10:02,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:02,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:10:02,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:10:02,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:02,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:02,368 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:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69125952] [2025-01-09 03:10:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69125952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:10:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833700880] [2025-01-09 03:10:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:10:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:02,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:10:02,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:10:02,369 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:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:02,379 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-01-09 03:10:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:10:02,379 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:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:02,380 INFO L225 Difference]: With dead ends: 33 [2025-01-09 03:10:02,380 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 03:10:02,380 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:02,381 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:02,381 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:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 03:10:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-01-09 03:10:02,384 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:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-01-09 03:10:02,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2025-01-09 03:10:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:02,385 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-01-09 03:10:02,385 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:02,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-01-09 03:10:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 03:10:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:02,385 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:02,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:10:02,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash -156697420, now seen corresponding path program 1 times [2025-01-09 03:10:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20993195] [2025-01-09 03:10:02,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:10:02,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:10:02,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:02,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842305373] [2025-01-09 03:10:02,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:02,410 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:02,412 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:02,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:10:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:10:02,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:02,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:02,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:10:02,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:02,577 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:02,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:10:02,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20993195] [2025-01-09 03:10:02,578 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:02,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842305373] [2025-01-09 03:10:02,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842305373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:10:02,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:10:02,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:10:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653398362] [2025-01-09 03:10:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:10:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:10:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:02,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:10:02,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:10:02,579 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:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:02,666 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-01-09 03:10:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:10:02,666 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:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:02,667 INFO L225 Difference]: With dead ends: 35 [2025-01-09 03:10:02,667 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 03:10:02,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:10:02,667 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:02,668 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:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 03:10:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-01-09 03:10:02,670 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:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-01-09 03:10:02,676 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2025-01-09 03:10:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:02,676 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-01-09 03:10:02,676 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:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-01-09 03:10:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:10:02,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:02,677 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:02,686 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:02,881 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:02,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:02,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash -716773380, now seen corresponding path program 1 times [2025-01-09 03:10:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941820090] [2025-01-09 03:10:02,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:02,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:02,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:02,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:02,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:02,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457663779] [2025-01-09 03:10:02,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:02,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:02,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:02,899 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:02,906 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:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:02,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:02,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:02,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 03:10:02,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:03,054 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:03,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:03,150 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:03,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:03,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941820090] [2025-01-09 03:10:03,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:03,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457663779] [2025-01-09 03:10:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457663779] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:03,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-01-09 03:10:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915261018] [2025-01-09 03:10:03,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:03,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:10:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:03,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:10:03,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:10:03,152 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:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:03,271 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-01-09 03:10:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 03:10:03,271 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:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:03,272 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:10:03,272 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 03:10:03,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:10:03,274 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:03,274 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:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 03:10:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2025-01-09 03:10:03,278 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:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-01-09 03:10:03,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2025-01-09 03:10:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-01-09 03:10:03,279 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:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-01-09 03:10:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:10:03,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:03,279 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:03,288 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:03,484 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:03,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:03,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash -643755639, now seen corresponding path program 1 times [2025-01-09 03:10:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:03,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904060266] [2025-01-09 03:10:03,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:03,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:03,551 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:03,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:03,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904060266] [2025-01-09 03:10:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904060266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:03,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635283060] [2025-01-09 03:10:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:03,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:03,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:03,555 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:03,558 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:03,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:10:03,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:10:03,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:03,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:10:03,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:03,610 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:03,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:03,644 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:03,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635283060] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:03,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:03,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-01-09 03:10:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472894575] [2025-01-09 03:10:03,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:10:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:03,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:10:03,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:10:03,645 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:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:03,696 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-01-09 03:10:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:10:03,696 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:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:03,697 INFO L225 Difference]: With dead ends: 72 [2025-01-09 03:10:03,697 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 03:10:03,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:10:03,698 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:03,698 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:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 03:10:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2025-01-09 03:10:03,719 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:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-01-09 03:10:03,719 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2025-01-09 03:10:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:03,719 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-01-09 03:10:03,719 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:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-01-09 03:10:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 03:10:03,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:03,723 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:03,730 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:03,923 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:03,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash 935756278, now seen corresponding path program 1 times [2025-01-09 03:10:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586276172] [2025-01-09 03:10:03,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:03,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:03,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:03,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:03,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:03,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:03,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555586142] [2025-01-09 03:10:03,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:03,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:03,952 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:03,954 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:03,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:03,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:03,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:03,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:03,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 03:10:03,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:04,115 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:04,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:04,221 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:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586276172] [2025-01-09 03:10:04,221 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555586142] [2025-01-09 03:10:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555586142] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:04,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:04,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-01-09 03:10:04,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580439053] [2025-01-09 03:10:04,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:04,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:10:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:04,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:10:04,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:10:04,222 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:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:04,342 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2025-01-09 03:10:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:10:04,343 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:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:04,345 INFO L225 Difference]: With dead ends: 86 [2025-01-09 03:10:04,345 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 03:10:04,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:10:04,346 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:04,346 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:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 03:10:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-01-09 03:10:04,362 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:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-01-09 03:10:04,363 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 27 [2025-01-09 03:10:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:04,363 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-01-09 03:10:04,363 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:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-01-09 03:10:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 03:10:04,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:04,364 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:04,374 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:04,570 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:04,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -85312076, now seen corresponding path program 1 times [2025-01-09 03:10:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091002128] [2025-01-09 03:10:04,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:04,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:04,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:04,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:04,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083336657] [2025-01-09 03:10:04,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:04,585 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:04,586 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:04,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:10:04,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:10:04,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:04,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:04,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 03:10:04,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:04,793 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:04,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:05,009 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:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091002128] [2025-01-09 03:10:05,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083336657] [2025-01-09 03:10:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083336657] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:05,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-01-09 03:10:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765092498] [2025-01-09 03:10:05,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 03:10:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:05,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 03:10:05,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:10:05,011 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:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:05,419 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2025-01-09 03:10:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 03:10:05,419 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:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:05,420 INFO L225 Difference]: With dead ends: 87 [2025-01-09 03:10:05,420 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 03:10:05,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 03:10:05,421 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:05,421 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.1s Time] [2025-01-09 03:10:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 03:10:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2025-01-09 03:10:05,430 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:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-01-09 03:10:05,430 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2025-01-09 03:10:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:05,430 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-01-09 03:10:05,430 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:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-01-09 03:10:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 03:10:05,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:05,431 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:05,439 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:05,631 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:05,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:05,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 380685067, now seen corresponding path program 2 times [2025-01-09 03:10:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73482869] [2025-01-09 03:10:05,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:05,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 03:10:05,648 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:05,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:05,958 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:05,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:05,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73482869] [2025-01-09 03:10:05,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73482869] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:10:05,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797020350] [2025-01-09 03:10:05,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:10:05,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:05,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:05,961 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:05,963 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:05,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 03:10:05,998 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:05,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:10:05,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:05,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:10:06,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:06,050 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:06,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:06,140 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:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797020350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:06,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:10:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2025-01-09 03:10:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904381650] [2025-01-09 03:10:06,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:06,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 03:10:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:06,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 03:10:06,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:10:06,142 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:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:06,252 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2025-01-09 03:10:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 03:10:06,253 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:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:06,254 INFO L225 Difference]: With dead ends: 126 [2025-01-09 03:10:06,254 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 03:10:06,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:10:06,254 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:06,255 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.0s Time] [2025-01-09 03:10:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 03:10:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 03:10:06,269 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:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2025-01-09 03:10:06,270 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 53 [2025-01-09 03:10:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:06,270 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2025-01-09 03:10:06,270 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:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2025-01-09 03:10:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:10:06,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:06,272 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:06,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:10:06,472 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:06,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:06,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1638130997, now seen corresponding path program 3 times [2025-01-09 03:10:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696508300] [2025-01-09 03:10:06,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:06,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-01-09 03:10:06,570 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:06,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 03:10:06,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247451360] [2025-01-09 03:10:06,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:10:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:06,573 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:06,575 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:06,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-01-09 03:10:06,620 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:06,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:10:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:10:06,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 03:10:06,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:10:06,785 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:06,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:06,986 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:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:10:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696508300] [2025-01-09 03:10:06,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:10:06,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247451360] [2025-01-09 03:10:06,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247451360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:10:06,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:10:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2025-01-09 03:10:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560934303] [2025-01-09 03:10:06,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:10:06,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 03:10:06,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:10:06,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 03:10:06,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:10:06,988 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 16 states have internal predecessors, (33), 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:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:10:07,111 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2025-01-09 03:10:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:10:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 16 states have internal predecessors, (33), 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 119 [2025-01-09 03:10:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:10:07,112 INFO L225 Difference]: With dead ends: 228 [2025-01-09 03:10:07,112 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 03:10:07,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:10:07,113 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:10:07,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:10:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 03:10:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-01-09 03:10:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 179 states have (on average 1.111731843575419) internal successors, (199), 179 states have internal predecessors, (199), 20 states have call successors, (20), 20 states have call predecessors, (20), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 03:10:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2025-01-09 03:10:07,156 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 119 [2025-01-09 03:10:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:10:07,156 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2025-01-09 03:10:07,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 16 states have internal predecessors, (33), 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:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2025-01-09 03:10:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:10:07,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:10:07,158 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:07,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 03:10:07,362 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:07,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:10:07,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:10:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash -958072627, now seen corresponding path program 1 times [2025-01-09 03:10:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:10:07,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729708246] [2025-01-09 03:10:07,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:10:07,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:10:07,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:10:07,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:07,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:10:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606189428] [2025-01-09 03:10:07,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:10:07,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:10:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:10:07,389 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:07,390 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:07,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:10:07,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:10:07,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:07,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:10:07,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:10:07,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:10:07,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:10:07,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:10:07,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:10:07,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:10:07,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:10:07,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:10:07,519 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:07,713 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:07,716 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:10:07,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:10:07,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:10:07 BoogieIcfgContainer [2025-01-09 03:10:07,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:10:07,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:10:07,751 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:10:07,751 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:10:07,752 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:01" (3/4) ... [2025-01-09 03:10:07,752 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:10:07,806 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 64. [2025-01-09 03:10:07,865 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:10:07,865 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:10:07,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:10:07,866 INFO L158 Benchmark]: Toolchain (without parser) took 6715.44ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 82.6MB in the end (delta: 40.8MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-01-09 03:10:07,866 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:07,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.88ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:10:07,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.93ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 111.1MB in the end (delta: 950.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:07,866 INFO L158 Benchmark]: Boogie Preprocessor took 26.01ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:10:07,867 INFO L158 Benchmark]: RCFGBuilder took 208.15ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 98.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 03:10:07,867 INFO L158 Benchmark]: TraceAbstraction took 6160.52ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.9MB in the end (delta: 4.2MB). Peak memory consumption was 246.3kB. Max. memory is 16.1GB. [2025-01-09 03:10:07,867 INFO L158 Benchmark]: Witness Printer took 114.48ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 82.6MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 03:10:07,868 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.27ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.88ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 112.0MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.93ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 111.1MB in the end (delta: 950.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.01ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 208.15ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 98.6MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6160.52ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 93.9MB in the end (delta: 4.2MB). Peak memory consumption was 246.3kB. Max. memory is 16.1GB. * Witness Printer took 114.48ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 82.6MB in the end (delta: 11.3MB). Peak memory consumption was 16.8MB. 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=38, Y=2, counter=0, v=-34, x=0, y=0] [L31] EXPR counter++ VAL [X=38, Y=2, counter=1, v=-34, x=0, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=1, v=-34, 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=38, Y=2, counter=1, v=-34, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=1, v=-34, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=1, v=-30, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=38, Y=2, counter=1, v=-30, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=38, Y=2, counter=2, v=-30, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=2, v=-30, 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=38, Y=2, counter=2, v=-30, x=1, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=2, v=-30, x=1, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=2, v=-26, x=1, xy=0, y=0, yx=2] [L45] x++ VAL [X=38, Y=2, counter=2, v=-26, x=2, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=38, Y=2, counter=3, v=-26, x=2, xy=0, y=0, yx=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=3, v=-26, 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=38, Y=2, counter=3, v=-26, x=2, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=3, v=-26, x=2, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=3, v=-22, x=2, xy=0, y=0, yx=4] [L45] x++ VAL [X=38, Y=2, counter=3, v=-22, x=3, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=38, Y=2, counter=4, v=-22, x=3, xy=0, y=0, yx=4] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=4, v=-22, 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=38, Y=2, counter=4, v=-22, x=3, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=4, v=-22, x=3, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=4, v=-18, x=3, xy=0, y=0, yx=6] [L45] x++ VAL [X=38, Y=2, counter=4, v=-18, x=4, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=38, Y=2, counter=5, v=-18, x=4, xy=0, y=0, yx=6] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=5, v=-18, 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=38, Y=2, counter=5, v=-18, x=4, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=5, v=-18, x=4, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=5, v=-14, x=4, xy=0, y=0, yx=8] [L45] x++ VAL [X=38, Y=2, counter=5, v=-14, x=5, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=38, Y=2, counter=6, v=-14, x=5, xy=0, y=0, yx=8] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=6, v=-14, 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=38, Y=2, counter=6, v=-14, x=5, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=6, v=-14, x=5, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=6, v=-10, x=5, xy=0, y=0, yx=10] [L45] x++ VAL [X=38, Y=2, counter=6, v=-10, x=6, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=38, Y=2, counter=7, v=-10, x=6, xy=0, y=0, yx=10] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=7, v=-10, 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=38, Y=2, counter=7, v=-10, x=6, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=7, v=-10, x=6, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=7, v=-6, x=6, xy=0, y=0, yx=12] [L45] x++ VAL [X=38, Y=2, counter=7, v=-6, x=7, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=38, Y=2, counter=8, v=-6, x=7, xy=0, y=0, yx=12] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=8, v=-6, 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=38, Y=2, counter=8, v=-6, x=7, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=8, v=-6, x=7, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=8, v=-2, x=7, xy=0, y=0, yx=14] [L45] x++ VAL [X=38, Y=2, counter=8, v=-2, x=8, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=38, Y=2, counter=9, v=-2, x=8, xy=0, y=0, yx=14] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=9, v=-2, 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=38, Y=2, counter=9, v=-2, x=8, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=9, v=-2, x=8, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=38, Y=2, counter=9, v=2, x=8, xy=0, y=0, yx=16] [L45] x++ VAL [X=38, Y=2, counter=9, v=2, x=9, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=38, Y=2, counter=10, v=2, x=9, xy=0, y=0, yx=16] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=38, Y=2, counter=10, v=2, 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=38, Y=2, counter=10, v=2, x=9, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=38, Y=2, counter=10, v=2, x=9, xy=0, y=0, yx=18] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=38, Y=2, counter=10, v=-70, x=9, xy=0, y=1, yx=18] [L45] x++ VAL [X=38, Y=2, counter=10, v=-70, x=10, xy=0, y=1, yx=18] [L31] EXPR counter++ VAL [X=38, Y=2, counter=11, v=-70, x=10, xy=0, y=1, yx=18] [L31] COND FALSE !(counter++<10) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=38, Y=2, counter=11, v=-70, xy=10, y=1, yx=20] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=11] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L16] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 816 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 671 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 761 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 145 mSDtfsCounter, 761 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 467 SyntacticMatches, 10 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=10, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 837 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 629 ConstructedInterpolants, 2 QuantifiedInterpolants, 2496 SizeOfPredicates, 29 NumberOfNonLiveVariables, 668 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 1140/1394 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:07,883 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