./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps6-ll.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/ps6-ll.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 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:09:52,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:09:52,093 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:52,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:09:52,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:09:52,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:09:52,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:09:52,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:09:52,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:09:52,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:09:52,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:09:52,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:09:52,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:09:52,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:09:52,122 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:09:52,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:09:52,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:09:52,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:09:52,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:09:52,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:09:52,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:09:52,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:09:52,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:09:52,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:09:52,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:09:52,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:09:52,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:09:52,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:09:52,125 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 -> 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 [2025-01-09 03:09:52,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:09:52,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:09:52,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:09:52,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:09:52,425 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:09:52,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/ps6-ll.c [2025-01-09 03:09:53,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bc37c1bb/ad1248e453a84b71851759a13e175dfc/FLAG19acdcc21 [2025-01-09 03:09:53,852 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:09:53,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps6-ll.c [2025-01-09 03:09:53,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bc37c1bb/ad1248e453a84b71851759a13e175dfc/FLAG19acdcc21 [2025-01-09 03:09:53,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bc37c1bb/ad1248e453a84b71851759a13e175dfc [2025-01-09 03:09:53,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:09:53,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:09:53,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:09:53,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:09:53,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:09:53,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:09:53" (1/1) ... [2025-01-09 03:09:53,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a37f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:53, skipping insertion in model container [2025-01-09 03:09:53,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:09:53" (1/1) ... [2025-01-09 03:09:53,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:09:53,998 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/ps6-ll.c[458,471] [2025-01-09 03:09:54,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:09:54,017 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:09:54,023 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/ps6-ll.c[458,471] [2025-01-09 03:09:54,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:09:54,034 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:09:54,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54 WrapperNode [2025-01-09 03:09:54,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:09:54,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:09:54,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:09:54,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:09:54,039 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:09:54" (1/1) ... [2025-01-09 03:09:54,043 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:09:54" (1/1) ... [2025-01-09 03:09:54,050 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2025-01-09 03:09:54,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:09:54,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:09:54,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:09:54,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:09:54,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,061 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:09:54,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:09:54,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:09:54,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:09:54,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:09:54,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (1/1) ... [2025-01-09 03:09:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:09:54,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:09:54,089 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:09:54,094 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:09:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:09:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:09:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:09:54,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:09:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:09:54,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:09:54,140 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:09:54,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:09:54,216 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:09:54,216 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:09:54,224 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:09:54,224 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:09:54,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:54 BoogieIcfgContainer [2025-01-09 03:09:54,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:09:54,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:09:54,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:09:54,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:09:54,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:09:53" (1/3) ... [2025-01-09 03:09:54,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43551340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:09:54, skipping insertion in model container [2025-01-09 03:09:54,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:09:54" (2/3) ... [2025-01-09 03:09:54,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43551340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:09:54, skipping insertion in model container [2025-01-09 03:09:54,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:09:54" (3/3) ... [2025-01-09 03:09:54,232 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2025-01-09 03:09:54,245 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:09:54,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:09:54,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:09:54,294 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;@2f1920ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:09:54,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:09:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 03:09:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:09:54,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:09:54,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:09:54,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:09:54,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:09:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 120200094, now seen corresponding path program 1 times [2025-01-09 03:09:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:09:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818180786] [2025-01-09 03:09:54,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:09:54,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:09:54,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:09:54,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:54,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:09:54,395 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:09:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:09:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818180786] [2025-01-09 03:09:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818180786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:09:54,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:09:54,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:09:54,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111009797] [2025-01-09 03:09:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:09:54,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:09:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:09:54,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:09:54,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:09:54,412 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:09:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:09:54,421 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-01-09 03:09:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:09:54,422 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:09:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:09:54,425 INFO L225 Difference]: With dead ends: 33 [2025-01-09 03:09:54,425 INFO L226 Difference]: Without dead ends: 14 [2025-01-09 03:09:54,427 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:09:54,428 INFO L435 NwaCegarLoop]: 20 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, 20 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:09:54,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:09:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-09 03:09:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-09 03:09:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:09:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-01-09 03:09:54,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2025-01-09 03:09:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:09:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-09 03:09:54,446 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:09:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-01-09 03:09:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 03:09:54,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:09:54,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:09:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:09:54,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:09:54,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:09:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 177458396, now seen corresponding path program 1 times [2025-01-09 03:09:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:09:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88676214] [2025-01-09 03:09:54,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:09:54,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:09:54,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:09:54,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:54,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:09:54,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958864501] [2025-01-09 03:09:54,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:54,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:54,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:09:54,463 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:09:54,465 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:09:54,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 03:09:54,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 03:09:54,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:54,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:09:54,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:09:54,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:09:54,565 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:09:54,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:09:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:09:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88676214] [2025-01-09 03:09:54,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:09:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958864501] [2025-01-09 03:09:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958864501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:09:54,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:09:54,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:09:54,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628308943] [2025-01-09 03:09:54,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:09:54,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:09:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:09:54,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:09:54,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:09:54,567 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:09:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:09:54,606 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-01-09 03:09:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:09:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:09:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:09:54,607 INFO L225 Difference]: With dead ends: 24 [2025-01-09 03:09:54,607 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 03:09:54,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:09:54,608 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:09:54,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:09:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 03:09:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 03:09:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 03:09:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-09 03:09:54,611 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2025-01-09 03:09:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:09:54,611 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-09 03:09:54,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:09:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-09 03:09:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 03:09:54,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:09:54,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:09:54,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:09:54,816 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:09:54,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:09:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:09:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash -761501731, now seen corresponding path program 1 times [2025-01-09 03:09:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:09:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852767951] [2025-01-09 03:09:54,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:09:54,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 03:09:54,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 03:09:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:09:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304469604] [2025-01-09 03:09:54,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:09:54,843 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:09:54,844 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:09:54,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 03:09:54,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 03:09:54,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:09:54,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 03:09:54,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:09:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:09:54,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:09:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 03:09:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:09:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852767951] [2025-01-09 03:09:55,015 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:09:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304469604] [2025-01-09 03:09:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304469604] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 03:09:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:09:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 03:09:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18578326] [2025-01-09 03:09:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:09:55,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:09:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:09:55,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:09:55,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:09:55,016 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:09:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:09:55,050 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-01-09 03:09:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:09:55,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-09 03:09:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:09:55,050 INFO L225 Difference]: With dead ends: 26 [2025-01-09 03:09:55,050 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 03:09:55,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:09:55,051 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:09:55,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:09:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 03:09:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 03:09:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 03:09:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-01-09 03:09:55,057 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2025-01-09 03:09:55,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:09:55,057 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-01-09 03:09:55,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:09:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-01-09 03:09:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 03:09:55,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:09:55,058 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:09:55,064 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:09:55,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:55,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:09:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:09:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash -128559133, now seen corresponding path program 1 times [2025-01-09 03:09:55,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:09:55,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154133110] [2025-01-09 03:09:55,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:09:55,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 03:09:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:09:55,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:55,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:09:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463454242] [2025-01-09 03:09:55,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:09:55,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:55,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:09:55,307 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:09:55,308 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:09:55,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 03:09:55,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 03:09:55,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:09:55,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:09:55,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 03:09:55,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:09:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:09:55,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:09:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:09:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:09:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154133110] [2025-01-09 03:09:55,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:09:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463454242] [2025-01-09 03:09:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463454242] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:09:55,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:09:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-01-09 03:09:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725046846] [2025-01-09 03:09:55,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:09:55,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:09:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:09:55,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:09:55,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:09:55,540 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:09:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:09:55,629 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2025-01-09 03:09:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:09:55,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 25 [2025-01-09 03:09:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:09:55,630 INFO L225 Difference]: With dead ends: 36 [2025-01-09 03:09:55,630 INFO L226 Difference]: Without dead ends: 28 [2025-01-09 03:09:55,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:09:55,631 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:09:55,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:09:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-09 03:09:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-09 03:09:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:09:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-09 03:09:55,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2025-01-09 03:09:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:09:55,643 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-09 03:09:55,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:09:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-09 03:09:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 03:09:55,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:09:55,643 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:09:55,657 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:09:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:55,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:09:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:09:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 399606656, now seen corresponding path program 2 times [2025-01-09 03:09:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:09:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845633245] [2025-01-09 03:09:55,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:09:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:09:55,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-09 03:09:55,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 03:09:55,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:09:55,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:09:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47129020] [2025-01-09 03:09:55,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:09:55,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:55,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:09:55,908 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:09:55,909 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:09:55,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-09 03:09:55,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 03:09:55,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:09:55,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:09:55,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 03:09:55,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:09:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 03:09:56,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:09:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 03:09:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:09:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845633245] [2025-01-09 03:09:56,336 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:09:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47129020] [2025-01-09 03:09:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47129020] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:09:56,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:09:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-01-09 03:09:56,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756063508] [2025-01-09 03:09:56,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:09:56,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 03:09:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:09:56,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 03:09:56,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-01-09 03:09:56,337 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 03:09:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:09:56,745 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-01-09 03:09:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 03:09:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 43 [2025-01-09 03:09:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:09:56,746 INFO L225 Difference]: With dead ends: 46 [2025-01-09 03:09:56,746 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 03:09:56,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2025-01-09 03:09:56,747 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:09:56,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 200 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:09:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 03:09:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-09 03:09:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:09:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-01-09 03:09:56,758 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 43 [2025-01-09 03:09:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:09:56,758 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-01-09 03:09:56,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 03:09:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2025-01-09 03:09:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 03:09:56,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:09:56,759 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:09:56,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:09:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:56,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:09:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:09:56,965 INFO L85 PathProgramCache]: Analyzing trace with hash 5371355, now seen corresponding path program 3 times [2025-01-09 03:09:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:09:56,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604090721] [2025-01-09 03:09:56,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:09:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:09:56,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 10 equivalence classes. [2025-01-09 03:09:57,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:09:57,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-09 03:09:57,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:09:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228403105] [2025-01-09 03:09:57,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:09:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:09:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:09:57,021 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:09:57,022 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:09:57,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 10 equivalence classes. [2025-01-09 03:09:57,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 03:09:57,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-09 03:09:57,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:09:57,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 03:09:57,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:09:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 48 proven. 94 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 03:09:57,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:10:05,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2025-01-09 03:10:13,464 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:10:25,478 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:10:37,489 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:10:45,521 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|))) (or (= .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23|)) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 10)) 12) 0))))) is different from true [2025-01-09 03:10:57,545 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:11:13,567 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:11:21,585 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38|))) (or (= .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_23|)) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_38| 10)) 12) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2025-01-09 03:11:30,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse0) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2025-01-09 03:11:42,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))))) is different from false