./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 ad40c7e9e7b0c80b1cec1e361a82d834fdd8270143479aa0f4bf8bc2b59c2aa5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 01:20:41,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 01:20:41,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 01:20:41,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 01:20:41,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 01:20:41,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 01:20:41,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 01:20:41,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 01:20:41,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 01:20:41,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 01:20:41,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 01:20:41,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 01:20:41,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 01:20:41,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 01:20:41,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 01:20:41,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 01:20:41,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 01:20:41,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 01:20:41,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 01:20:41,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 01:20:41,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 01:20:41,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 01:20:41,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 01:20:41,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 01:20:41,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 01:20:41,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 01:20:41,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 01:20:41,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 01:20:41,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 01:20:41,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 01:20:41,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 01:20:41,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 01:20:41,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 01:20:41,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 01:20:41,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 01:20:41,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 01:20:41,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 01:20:41,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 01:20:41,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 01:20:41,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 01:20:41,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 01:20:41,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 01:20:41,752 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 01:20:41,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 01:20:41,753 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 01:20:41,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 01:20:41,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 01:20:41,754 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 01:20:41,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 01:20:41,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 01:20:41,754 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 01:20:41,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 01:20:41,755 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 01:20:41,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 01:20:41,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 01:20:41,756 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 01:20:41,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 01:20:41,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 01:20:41,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 01:20:41,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 01:20:41,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:20:41,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 01:20:41,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 01:20:41,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 01:20:41,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 01:20:41,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 01:20:41,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 01:20:41,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 01:20:41,759 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 01:20:41,759 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 01:20:41,759 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 01:20:41,759 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ad40c7e9e7b0c80b1cec1e361a82d834fdd8270143479aa0f4bf8bc2b59c2aa5 [2023-02-18 01:20:41,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 01:20:41,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 01:20:41,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 01:20:41,983 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 01:20:41,983 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 01:20:41,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c [2023-02-18 01:20:42,846 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 01:20:43,024 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 01:20:43,025 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c [2023-02-18 01:20:43,029 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb64b9042/0ef3519a80504844a3d86d0dfeaa49f8/FLAG532ca834a [2023-02-18 01:20:43,041 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb64b9042/0ef3519a80504844a3d86d0dfeaa49f8 [2023-02-18 01:20:43,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 01:20:43,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 01:20:43,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 01:20:43,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 01:20:43,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 01:20:43,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d35f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43, skipping insertion in model container [2023-02-18 01:20:43,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 01:20:43,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 01:20:43,162 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c[588,601] [2023-02-18 01:20:43,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:20:43,180 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 01:20:43,187 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_valuebound5.c[588,601] [2023-02-18 01:20:43,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 01:20:43,201 INFO L208 MainTranslator]: Completed translation [2023-02-18 01:20:43,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43 WrapperNode [2023-02-18 01:20:43,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 01:20:43,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 01:20:43,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 01:20:43,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 01:20:43,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,222 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2023-02-18 01:20:43,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 01:20:43,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 01:20:43,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 01:20:43,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 01:20:43,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 01:20:43,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 01:20:43,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 01:20:43,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 01:20:43,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (1/1) ... [2023-02-18 01:20:43,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 01:20:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:43,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 01:20:43,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 01:20:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 01:20:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 01:20:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 01:20:43,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 01:20:43,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 01:20:43,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 01:20:43,325 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 01:20:43,326 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 01:20:43,416 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 01:20:43,419 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 01:20:43,420 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 01:20:43,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:20:43 BoogieIcfgContainer [2023-02-18 01:20:43,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 01:20:43,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 01:20:43,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 01:20:43,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 01:20:43,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:20:43" (1/3) ... [2023-02-18 01:20:43,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450b8101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:20:43, skipping insertion in model container [2023-02-18 01:20:43,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:20:43" (2/3) ... [2023-02-18 01:20:43,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450b8101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:20:43, skipping insertion in model container [2023-02-18 01:20:43,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:20:43" (3/3) ... [2023-02-18 01:20:43,426 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound5.c [2023-02-18 01:20:43,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 01:20:43,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 01:20:43,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 01:20:43,475 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2d487c00, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 01:20:43,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 01:20:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 01:20:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:20:43,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:43,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:43,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -588951690, now seen corresponding path program 1 times [2023-02-18 01:20:43,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:43,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529884492] [2023-02-18 01:20:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529884492] [2023-02-18 01:20:43,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529884492] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:20:43,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:20:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 01:20:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4682647] [2023-02-18 01:20:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:20:43,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 01:20:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 01:20:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 01:20:43,672 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-02-18 01:20:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:43,695 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2023-02-18 01:20:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 01:20:43,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 [2023-02-18 01:20:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:43,702 INFO L225 Difference]: With dead ends: 51 [2023-02-18 01:20:43,702 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 01:20:43,705 INFO L412 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 [2023-02-18 01:20:43,710 INFO L413 NwaCegarLoop]: 37 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, 37 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 [2023-02-18 01:20:43,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 01:20:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 01:20:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 01:20:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:20:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2023-02-18 01:20:43,741 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2023-02-18 01:20:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:43,742 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2023-02-18 01:20:43,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2023-02-18 01:20:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2023-02-18 01:20:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 01:20:43,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:43,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:43,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 01:20:43,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:43,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1187604804, now seen corresponding path program 1 times [2023-02-18 01:20:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:43,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662800249] [2023-02-18 01:20:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:43,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662800249] [2023-02-18 01:20:43,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662800249] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:20:43,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:20:43,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 01:20:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791036867] [2023-02-18 01:20:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:20:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 01:20:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 01:20:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 01:20:43,922 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2023-02-18 01:20:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:44,019 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2023-02-18 01:20:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 01:20:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2023-02-18 01:20:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:44,020 INFO L225 Difference]: With dead ends: 29 [2023-02-18 01:20:44,020 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 01:20:44,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 01:20:44,022 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:44,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:20:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 01:20:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-18 01:20:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 01:20:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-18 01:20:44,032 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2023-02-18 01:20:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:44,032 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-18 01:20:44,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2023-02-18 01:20:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-18 01:20:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 01:20:44,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:44,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:44,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 01:20:44,033 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1137950087, now seen corresponding path program 1 times [2023-02-18 01:20:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:44,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604070390] [2023-02-18 01:20:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:44,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227880141] [2023-02-18 01:20:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:44,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:44,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 01:20:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:44,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:20:44,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:44,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 01:20:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604070390] [2023-02-18 01:20:44,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227880141] [2023-02-18 01:20:44,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227880141] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:44,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:44,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785019555] [2023-02-18 01:20:44,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:44,293 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:20:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:44,730 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2023-02-18 01:20:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:20:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 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 14 [2023-02-18 01:20:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:44,733 INFO L225 Difference]: With dead ends: 52 [2023-02-18 01:20:44,733 INFO L226 Difference]: Without dead ends: 50 [2023-02-18 01:20:44,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:44,734 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:44,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 01:20:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-18 01:20:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-02-18 01:20:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:20:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2023-02-18 01:20:44,745 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 14 [2023-02-18 01:20:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:44,745 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2023-02-18 01:20:44,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 01:20:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2023-02-18 01:20:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 01:20:44,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:44,746 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:44,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 01:20:44,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:44,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1500531996, now seen corresponding path program 1 times [2023-02-18 01:20:44,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:44,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491040394] [2023-02-18 01:20:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:44,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:44,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075105671] [2023-02-18 01:20:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:44,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:44,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:44,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:44,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 01:20:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:45,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 01:20:45,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:20:45,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 01:20:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491040394] [2023-02-18 01:20:45,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075105671] [2023-02-18 01:20:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075105671] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:45,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:45,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000206392] [2023-02-18 01:20:45,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:45,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:45,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:45,069 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:20:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:45,248 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2023-02-18 01:20:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:20:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 01:20:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:45,250 INFO L225 Difference]: With dead ends: 54 [2023-02-18 01:20:45,250 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 01:20:45,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:45,251 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:45,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 47 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:20:45,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 01:20:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2023-02-18 01:20:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 01:20:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-18 01:20:45,266 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2023-02-18 01:20:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:45,267 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-18 01:20:45,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 01:20:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-18 01:20:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 01:20:45,268 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:45,268 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:45,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:45,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 01:20:45,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1926539111, now seen corresponding path program 1 times [2023-02-18 01:20:45,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:45,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194932128] [2023-02-18 01:20:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:45,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:45,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763293911] [2023-02-18 01:20:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:45,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:45,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 01:20:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:45,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 01:20:45,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:20:45,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 01:20:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:45,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194932128] [2023-02-18 01:20:45,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:45,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763293911] [2023-02-18 01:20:45,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763293911] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:45,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382490279] [2023-02-18 01:20:45,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:45,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:45,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:45,697 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:20:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:46,464 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2023-02-18 01:20:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 01:20:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2023-02-18 01:20:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:46,465 INFO L225 Difference]: With dead ends: 67 [2023-02-18 01:20:46,465 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 01:20:46,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:46,466 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:46,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 01:20:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 01:20:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-18 01:20:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-02-18 01:20:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-02-18 01:20:46,476 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2023-02-18 01:20:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:46,477 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-02-18 01:20:46,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 01:20:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-02-18 01:20:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 01:20:46,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:46,478 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:46,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 01:20:46,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:46,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1495173479, now seen corresponding path program 1 times [2023-02-18 01:20:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:46,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467445624] [2023-02-18 01:20:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:46,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385056195] [2023-02-18 01:20:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:46,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:46,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:46,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 01:20:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:46,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:20:46,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 01:20:46,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 01:20:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:46,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467445624] [2023-02-18 01:20:46,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385056195] [2023-02-18 01:20:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385056195] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:46,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:46,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-18 01:20:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822268523] [2023-02-18 01:20:46,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:46,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:20:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:46,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:20:46,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:46,848 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 01:20:49,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:20:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:49,551 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2023-02-18 01:20:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:20:49,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-18 01:20:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:49,552 INFO L225 Difference]: With dead ends: 82 [2023-02-18 01:20:49,552 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 01:20:49,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:20:49,553 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:49,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 281 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2023-02-18 01:20:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 01:20:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-18 01:20:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 45 states have internal predecessors, (45), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:20:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2023-02-18 01:20:49,568 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 46 [2023-02-18 01:20:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:49,568 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2023-02-18 01:20:49,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 01:20:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2023-02-18 01:20:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 01:20:49,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:49,569 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:49,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:49,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1498221753, now seen corresponding path program 2 times [2023-02-18 01:20:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:49,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071238720] [2023-02-18 01:20:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:49,787 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:49,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504062645] [2023-02-18 01:20:49,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:49,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:49,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:49,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 01:20:49,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:49,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:49,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 01:20:49,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 01:20:49,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-18 01:20:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071238720] [2023-02-18 01:20:49,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504062645] [2023-02-18 01:20:49,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504062645] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:49,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:49,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 01:20:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821721558] [2023-02-18 01:20:49,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:49,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:20:49,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:20:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:20:49,942 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-18 01:20:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:50,421 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-02-18 01:20:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:20:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 56 [2023-02-18 01:20:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:50,422 INFO L225 Difference]: With dead ends: 86 [2023-02-18 01:20:50,422 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 01:20:50,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:50,423 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:50,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 01:20:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 01:20:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 01:20:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 01:20:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-02-18 01:20:50,436 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 56 [2023-02-18 01:20:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:50,437 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-02-18 01:20:50,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-18 01:20:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-02-18 01:20:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 01:20:50,442 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:50,442 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:50,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:50,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:50,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1061977627, now seen corresponding path program 1 times [2023-02-18 01:20:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710603232] [2023-02-18 01:20:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:50,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:50,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618251673] [2023-02-18 01:20:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:50,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:50,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 01:20:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:50,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 01:20:50,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 01:20:50,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 01:20:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:50,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710603232] [2023-02-18 01:20:50,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:50,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618251673] [2023-02-18 01:20:50,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618251673] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:50,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:50,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 01:20:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410708986] [2023-02-18 01:20:50,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:50,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 01:20:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:50,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 01:20:50,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:50,862 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 01:20:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:51,240 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2023-02-18 01:20:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 01:20:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2023-02-18 01:20:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:51,243 INFO L225 Difference]: With dead ends: 95 [2023-02-18 01:20:51,243 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 01:20:51,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:20:51,243 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:51,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 01:20:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 01:20:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2023-02-18 01:20:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-02-18 01:20:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2023-02-18 01:20:51,280 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 67 [2023-02-18 01:20:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:51,281 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2023-02-18 01:20:51,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 01:20:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2023-02-18 01:20:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 01:20:51,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:51,282 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:51,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:51,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:51,488 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1246911088, now seen corresponding path program 1 times [2023-02-18 01:20:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:51,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584960962] [2023-02-18 01:20:51,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:51,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:51,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119242986] [2023-02-18 01:20:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:51,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:51,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:51,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:51,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 01:20:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:20:51,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 01:20:51,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 01:20:51,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584960962] [2023-02-18 01:20:51,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:51,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119242986] [2023-02-18 01:20:51,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119242986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:20:51,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:20:51,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2023-02-18 01:20:51,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64648275] [2023-02-18 01:20:51,685 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:51,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 01:20:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 01:20:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-18 01:20:51,688 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 01:20:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:51,822 INFO L93 Difference]: Finished difference Result 97 states and 114 transitions. [2023-02-18 01:20:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 01:20:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 72 [2023-02-18 01:20:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:51,825 INFO L225 Difference]: With dead ends: 97 [2023-02-18 01:20:51,825 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 01:20:51,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-02-18 01:20:51,828 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:51,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:20:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 01:20:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 01:20:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:20:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2023-02-18 01:20:51,852 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 72 [2023-02-18 01:20:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:51,853 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2023-02-18 01:20:51,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-18 01:20:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2023-02-18 01:20:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 01:20:51,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:51,854 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:51,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:52,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:52,062 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash -322800313, now seen corresponding path program 3 times [2023-02-18 01:20:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:52,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995871654] [2023-02-18 01:20:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:52,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098760899] [2023-02-18 01:20:52,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:20:52,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:52,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:52,069 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:52,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 01:20:52,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 01:20:52,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:52,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 01:20:52,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 01:20:52,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 01:20:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:52,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995871654] [2023-02-18 01:20:52,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:52,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098760899] [2023-02-18 01:20:52,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098760899] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:52,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:52,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 01:20:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078442956] [2023-02-18 01:20:52,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:52,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 01:20:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 01:20:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-18 01:20:52,302 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 01:20:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:54,060 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-18 01:20:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:20:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 78 [2023-02-18 01:20:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:54,061 INFO L225 Difference]: With dead ends: 110 [2023-02-18 01:20:54,061 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 01:20:54,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:20:54,061 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:54,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-18 01:20:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 01:20:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-02-18 01:20:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-02-18 01:20:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-18 01:20:54,079 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 78 [2023-02-18 01:20:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:54,080 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-18 01:20:54,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-18 01:20:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-18 01:20:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-18 01:20:54,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:54,081 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:54,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:54,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 01:20:54,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -674604307, now seen corresponding path program 2 times [2023-02-18 01:20:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:54,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372195226] [2023-02-18 01:20:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:54,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:54,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834919659] [2023-02-18 01:20:54,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:54,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:54,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 01:20:54,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:54,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:54,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 01:20:54,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 78 proven. 25 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-02-18 01:20:54,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372195226] [2023-02-18 01:20:54,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:54,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834919659] [2023-02-18 01:20:54,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834919659] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 01:20:54,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 01:20:54,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-18 01:20:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407070591] [2023-02-18 01:20:54,997 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:54,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 01:20:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:54,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 01:20:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2023-02-18 01:20:54,998 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 01:20:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:55,279 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2023-02-18 01:20:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 01:20:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 99 [2023-02-18 01:20:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:55,280 INFO L225 Difference]: With dead ends: 111 [2023-02-18 01:20:55,280 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 01:20:55,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=270, Unknown=1, NotChecked=0, Total=342 [2023-02-18 01:20:55,281 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:55,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 01:20:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 01:20:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-18 01:20:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 59 states have internal predecessors, (60), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:20:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2023-02-18 01:20:55,299 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 99 [2023-02-18 01:20:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:55,300 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2023-02-18 01:20:55,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-18 01:20:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2023-02-18 01:20:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-18 01:20:55,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:55,304 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:55,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:55,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:55,509 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1837317061, now seen corresponding path program 2 times [2023-02-18 01:20:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139454080] [2023-02-18 01:20:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:55,520 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:55,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490068116] [2023-02-18 01:20:55,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:20:55,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:55,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:55,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:55,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 01:20:55,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:20:55,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:55,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-18 01:20:55,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:20:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-02-18 01:20:55,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:20:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2023-02-18 01:20:56,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:20:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139454080] [2023-02-18 01:20:56,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:20:56,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490068116] [2023-02-18 01:20:56,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490068116] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:20:56,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:20:56,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-18 01:20:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632193645] [2023-02-18 01:20:56,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:20:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 01:20:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:20:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 01:20:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-02-18 01:20:56,052 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 01:20:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:20:58,592 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2023-02-18 01:20:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 01:20:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 121 [2023-02-18 01:20:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:20:58,594 INFO L225 Difference]: With dead ends: 119 [2023-02-18 01:20:58,594 INFO L226 Difference]: Without dead ends: 117 [2023-02-18 01:20:58,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2023-02-18 01:20:58,594 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:20:58,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 126 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-18 01:20:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-18 01:20:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2023-02-18 01:20:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 24 states have call successors, (24), 16 states have call predecessors, (24), 16 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:20:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-02-18 01:20:58,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 121 [2023-02-18 01:20:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:20:58,612 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-02-18 01:20:58,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 01:20:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-02-18 01:20:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-18 01:20:58,613 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:20:58,613 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:20:58,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 01:20:58,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-18 01:20:58,814 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:20:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:20:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1974193296, now seen corresponding path program 3 times [2023-02-18 01:20:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:20:58,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279939988] [2023-02-18 01:20:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:20:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:20:58,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:20:58,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304657672] [2023-02-18 01:20:58,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 01:20:58,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:20:58,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:20:58,824 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:20:58,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 01:20:58,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 01:20:58,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:20:58,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-18 01:20:58,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:21:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 261 proven. 74 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2023-02-18 01:21:07,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:21:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-02-18 01:21:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:21:07,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279939988] [2023-02-18 01:21:07,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:21:07,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304657672] [2023-02-18 01:21:07,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304657672] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:21:07,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:21:07,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2023-02-18 01:21:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865526766] [2023-02-18 01:21:07,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:21:07,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 01:21:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:21:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 01:21:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=274, Unknown=1, NotChecked=0, Total=342 [2023-02-18 01:21:07,482 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 19 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 10 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 9 states have call predecessors, (31), 10 states have call successors, (31) [2023-02-18 01:21:10,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:21:12,241 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2023-02-18 01:21:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 01:21:12,242 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 10 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 9 states have call predecessors, (31), 10 states have call successors, (31) Word has length 126 [2023-02-18 01:21:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:21:12,242 INFO L225 Difference]: With dead ends: 116 [2023-02-18 01:21:12,243 INFO L226 Difference]: Without dead ends: 112 [2023-02-18 01:21:12,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 226 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=142, Invalid=507, Unknown=1, NotChecked=0, Total=650 [2023-02-18 01:21:12,243 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-18 01:21:12,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 50 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 183 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2023-02-18 01:21:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-18 01:21:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-02-18 01:21:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 24 states have call successors, (24), 19 states have call predecessors, (24), 18 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-18 01:21:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2023-02-18 01:21:12,291 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 126 [2023-02-18 01:21:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:21:12,292 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2023-02-18 01:21:12,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 10 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 9 states have call predecessors, (31), 10 states have call successors, (31) [2023-02-18 01:21:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2023-02-18 01:21:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-02-18 01:21:12,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:21:12,294 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:21:12,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 01:21:12,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 01:21:12,500 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:21:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:21:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1520954085, now seen corresponding path program 1 times [2023-02-18 01:21:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:21:12,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025478936] [2023-02-18 01:21:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:21:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:21:12,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:21:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269481654] [2023-02-18 01:21:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:21:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:21:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:21:12,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:21:12,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 01:21:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 01:21:12,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-18 01:21:12,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:21:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 104 proven. 110 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-18 01:21:13,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 01:21:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 104 proven. 110 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-18 01:21:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:21:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025478936] [2023-02-18 01:21:20,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:21:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269481654] [2023-02-18 01:21:20,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269481654] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 01:21:20,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 01:21:20,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2023-02-18 01:21:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998353329] [2023-02-18 01:21:20,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 01:21:20,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 01:21:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:21:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 01:21:20,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=298, Unknown=4, NotChecked=0, Total=380 [2023-02-18 01:21:20,241 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 20 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2023-02-18 01:21:23,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:26,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:30,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:32,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:35,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:37,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:39,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:41,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:44,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:47,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:50,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 01:21:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:21:51,649 INFO L93 Difference]: Finished difference Result 167 states and 205 transitions. [2023-02-18 01:21:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 01:21:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 131 [2023-02-18 01:21:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:21:51,650 INFO L225 Difference]: With dead ends: 167 [2023-02-18 01:21:51,650 INFO L226 Difference]: Without dead ends: 155 [2023-02-18 01:21:51,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=191, Invalid=617, Unknown=4, NotChecked=0, Total=812 [2023-02-18 01:21:51,654 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 99 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2023-02-18 01:21:51,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 123 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 830 Invalid, 10 Unknown, 0 Unchecked, 30.4s Time] [2023-02-18 01:21:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-18 01:21:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-02-18 01:21:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 85 states have (on average 1.011764705882353) internal successors, (86), 85 states have internal predecessors, (86), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-02-18 01:21:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2023-02-18 01:21:51,729 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 131 [2023-02-18 01:21:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:21:51,729 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2023-02-18 01:21:51,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 11 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2023-02-18 01:21:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2023-02-18 01:21:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-02-18 01:21:51,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 01:21:51,732 INFO L195 NwaCegarLoop]: trace histogram [49, 48, 48, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 01:21:51,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 01:21:51,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 01:21:51,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 01:21:51,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 01:21:51,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1512061602, now seen corresponding path program 2 times [2023-02-18 01:21:51,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 01:21:51,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613561775] [2023-02-18 01:21:51,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 01:21:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 01:21:51,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 01:21:51,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881808617] [2023-02-18 01:21:51,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 01:21:51,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 01:21:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 01:21:51,947 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 01:21:51,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 01:21:52,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 01:21:52,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 01:21:52,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 01:21:52,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 01:21:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4860 backedges. 1612 proven. 0 refuted. 0 times theorem prover too weak. 3248 trivial. 0 not checked. [2023-02-18 01:21:52,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 01:21:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 01:21:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613561775] [2023-02-18 01:21:52,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 01:21:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881808617] [2023-02-18 01:21:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881808617] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 01:21:52,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 01:21:52,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-18 01:21:52,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987245670] [2023-02-18 01:21:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 01:21:52,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 01:21:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 01:21:52,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 01:21:52,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2023-02-18 01:21:52,096 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2023-02-18 01:21:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 01:21:52,273 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2023-02-18 01:21:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 01:21:52,273 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) Word has length 266 [2023-02-18 01:21:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 01:21:52,273 INFO L225 Difference]: With dead ends: 175 [2023-02-18 01:21:52,273 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 01:21:52,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2023-02-18 01:21:52,275 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 01:21:52,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 01:21:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 01:21:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 01:21:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 01:21:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 01:21:52,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 266 [2023-02-18 01:21:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 01:21:52,276 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 01:21:52,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (48), 9 states have call predecessors, (48), 9 states have call successors, (48) [2023-02-18 01:21:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 01:21:52,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 01:21:52,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 01:21:52,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 01:21:52,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 01:21:52,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 01:21:52,512 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 01:21:52,514 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse30 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse38 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse53 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse39 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse19 (not .cse30)) (.cse24 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse57 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse72 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse68 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse29 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse54 (+ .cse72 .cse68)) (.cse73 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse75 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse60 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse56 (or .cse30 (let ((.cse80 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse79 (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse19 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse79) (or (not .cse79) (not (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse24)) .cse57))))) (.cse8 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse16 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse14 (= (+ .cse38 (+ (* |ULTIMATE.start_main_~x~0#1| .cse53) .cse39)) 0)) (.cse15 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse74 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse76 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse71 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse12 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse33 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse22 (+ 0 1)) (.cse0 (+ (* (- 1) .cse24) |ULTIMATE.start_main_~y~0#1|)) (.cse51 (+ .cse71 .cse68)) (.cse50 (+ .cse71 6)) (.cse55 (= (+ (+ (+ (- .cse74) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse53))) .cse76) (- 10)) 0)) (.cse7 (or .cse19 .cse14 .cse15)) (.cse42 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse13 (+ 6 12)) (.cse5 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse8 .cse16) (and (or (not .cse8) (not .cse16)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse17 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse18 (let ((.cse77 (= (+ (let ((.cse78 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse78 (* .cse78 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse56 .cse77) (and .cse56 (or .cse19 .cse77))))) (.cse23 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse75 .cse60))) 0)) (.cse26 (= (+ (- 6) (+ (+ .cse75 (+ .cse73 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse76)) 0)) (.cse61 (- (* 18 .cse54))) (.cse52 (+ .cse29 1)) (.cse28 (= (+ (+ (- (* .cse71 .cse72)) (* .cse72 .cse53)) (* .cse72 12)) 0)) (.cse27 (not .cse15)) (.cse70 (- (* .cse72 18))) (.cse46 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse73 (+ (* .cse74 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0))) (let ((.cse3 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (+ 6 1)) (.cse9 (+ 6 6)) (.cse20 (= .cse72 (* .cse29 (* .cse29 .cse29)))) (.cse11 (* (- 1) 6)) (.cse44 (or .cse46 (not .cse14))) (.cse43 (or (not .cse28) .cse27 (= (+ (+ (+ (+ (+ (- (* .cse71 (* 3 .cse72))) (* (* 2 .cse68) .cse68)) .cse70) (- (* .cse68 10))) (* .cse71 3)) (- 10)) 0))) (.cse36 (let ((.cse62 (let ((.cse67 (+ 6 (* .cse29 6)))) (let ((.cse69 (not (= .cse67 .cse71)))) (let ((.cse63 (or .cse69 (= (+ (+ (+ (- (* .cse68 12)) (+ .cse70 (* .cse67 .cse68))) (* .cse67 2)) (- 6)) 0))) (.cse64 (or (= 0 (+ (- 6) (let ((.cse65 (+ 6 (* 6 .cse52)))) (+ (* 2 .cse65) (let ((.cse66 (+ .cse67 .cse68))) (+ (+ (* .cse66 .cse65) .cse61) (- (* .cse66 12)))))))) .cse69))) (or (and .cse5 .cse26 .cse8 .cse63 .cse16 .cse17 .cse18 .cse23 .cse64) (and .cse5 .cse8 .cse63 .cse16 .cse17 .cse18 .cse23 .cse64 (or .cse19 .cse26)))))))) (or (and .cse62 .cse7) (and .cse62 (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse42 (= (+ 6 .cse13) |ULTIMATE.start_main_~z~0#1|))))) (.cse6 (or .cse55 .cse15)) (.cse45 (or (= (+ (- 10) (+ (* .cse50 3) (+ (+ (+ (- (* .cse50 (* 3 .cse54))) (* (* 2 .cse51) .cse51)) .cse61) (- (* .cse51 10))))) 0) (not (= (+ (+ (- (* .cse50 .cse54)) (* .cse53 .cse54)) (* 12 .cse54)) 0)) (not (<= .cse29 |ULTIMATE.start_main_~a~0#1|)))) (.cse2 (= (+ (+ (- (* .cse24 6)) (+ (* .cse24 .cse24) (- (* .cse0 12)))) 12) 0)) (.cse4 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse60 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse31 (<= |ULTIMATE.start_main_~n~0#1| .cse22)) (.cse21 (let ((.cse58 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse58 .cse33) (let ((.cse59 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse59 65536) (<= 0 .cse59) (not .cse58)))))) (.cse34 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse25 (<= .cse12 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse10 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse0 .cse1) .cse2 (<= 7 .cse3) .cse4 (<= 7 (+ |ULTIMATE.start_main_~y~0#1| (- 12))) .cse5 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 1)) .cse7 .cse8 (= .cse9 .cse10) (= (+ (+ 7 .cse11) 0) (+ (* (- 1) 7) |ULTIMATE.start_main_~x~0#1|)) (<= 1 .cse12) (= |ULTIMATE.start_main_~z~0#1| .cse13) (or .cse14 .cse15) (= (+ 6 .cse10) |ULTIMATE.start_main_~z~0#1|) .cse16 .cse17 .cse18 (or .cse19 .cse20) .cse21 (= .cse12 .cse22) .cse23 (= .cse9 .cse24) .cse25 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse24)) (= 0 (+ (- 1) .cse12)))) (let ((.cse32 (+ .cse11 |ULTIMATE.start_main_~y~0#1|))) (and (<= 0 .cse3) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 .cse4 (= .cse12 0) (= |ULTIMATE.start_main_~x~0#1| .cse22) (= |ULTIMATE.start_main_~n~0#1| .cse22) (= |ULTIMATE.start_main_~y~0#1| .cse1) .cse5 .cse26 .cse7 (= .cse9 |ULTIMATE.start_main_~z~0#1|) .cse8 (or .cse27 .cse28 (< .cse29 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse30 (= |ULTIMATE.start_main_~y~0#1| (+ .cse24 1)) .cse20 .cse16 .cse31 (<= 1 (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|)) .cse18 .cse21 (= .cse32 1) (<= 0 .cse12) .cse33 .cse34 (= .cse24 6) .cse25 (= (+ .cse32 0) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse35 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (<= 2 .cse12) (= |ULTIMATE.start_main_~x~0#1| (+ .cse35 8)) .cse2 .cse4 .cse36 .cse5 .cse6 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse37 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse37 65536) (<= 2 .cse37) (= (+ .cse38 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse37)) .cse39)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse37) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse41 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse40 (+ 65536 .cse41))) (and (<= 0 .cse40) (<= 2 .cse41) (= (+ .cse38 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse41)) .cse39)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse40 65536)))))) .cse8 .cse16 .cse21 (= (+ 7 (+ (- 6) 18)) .cse35) .cse42 .cse25)) (and .cse43 (<= 5 .cse12) .cse2 .cse4 .cse36 .cse5 .cse6 .cse8 .cse16 .cse44 .cse25) (and .cse43 .cse2 .cse4 .cse36 .cse5 .cse6 .cse8 (<= 4 .cse12) .cse16 .cse44 .cse25 .cse45) (and .cse43 .cse2 .cse4 .cse36 .cse5 (<= 3 .cse12) .cse6 .cse46 .cse8 (let ((.cse49 (+ .cse50 6)) (.cse48 (+ .cse51 .cse54))) (or (= (+ (+ (let ((.cse47 (+ .cse50 .cse51))) (+ (- (* .cse47 10)) (+ (- (* .cse48 18)) (+ (- (* .cse49 (* .cse48 3))) (* .cse47 (* .cse47 2)))))) (* .cse49 3)) (- 10)) 0) (not (<= .cse52 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse48 12) (+ (- (* .cse49 .cse48)) (* .cse48 .cse53))) 0)))) .cse16 .cse21 .cse25 .cse45) (and .cse55 .cse14 .cse2 .cse4 .cse5 .cse56 .cse8 (>= |ULTIMATE.start_main_~n~0#1| 0) (>= |ULTIMATE.start_main_~y~0#1| 1) .cse30 (= |ULTIMATE.start_main_~y~0#1| 1) .cse16 .cse31 .cse57 .cse21 .cse33 .cse34 (>= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) .cse25 (= 6 |ULTIMATE.start_main_~z~0#1|)))))))) [2023-02-18 01:21:52,515 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse33 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse43 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse34 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse35 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse44 (+ .cse34 .cse35)) (.cse62 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse18 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse19 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse32 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse31 (= (+ (+ (- (* .cse33 .cse34)) (* .cse34 .cse43)) (* .cse34 12)) 0)) (.cse48 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse10 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse57 (not .cse23)) (.cse8 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse63 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse45 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse53 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse29 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse6 .cse11) (and (or (not .cse6) (not .cse11)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (= (+ (- 6) (+ (+ .cse63 (+ .cse45 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse0 (or .cse23 (let ((.cse66 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse65 (<= (+ .cse66 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse57 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse65) (or (not .cse65) (not (<= (+ .cse66 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse8)) .cse1))))) (.cse5 (= (+ (let ((.cse64 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse64 (* .cse64 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse7 (or .cse32 .cse31 (< .cse48 .cse10))) (.cse9 (= .cse34 (* .cse48 (* .cse48 .cse48)))) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse46 (= (+ .cse18 (+ (* |ULTIMATE.start_main_~x~0#1| .cse43) .cse19)) 0)) (.cse52 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse63 .cse62))) 0)) (.cse47 (- (* 18 .cse44))) (.cse42 (+ .cse48 1)) (.cse36 (- (* .cse34 18))) (.cse54 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse49 (+ (* (- 1) .cse8) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse15 (= (+ (+ (- (* .cse8 6)) (+ (* .cse8 .cse8) (- (* .cse49 12)))) 12) 0)) (.cse16 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse62 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse22 (<= (+ (- 1) .cse54) |ULTIMATE.start_main_~a~0#1|)) (.cse24 (let ((.cse60 (+ 6 (* .cse48 6)))) (let ((.cse61 (not (= .cse60 .cse33)))) (let ((.cse55 (or .cse61 (= (+ (+ (+ (- (* .cse35 12)) (+ .cse36 (* .cse60 .cse35))) (* .cse60 2)) (- 6)) 0))) (.cse56 (or (= 0 (+ (- 6) (let ((.cse58 (+ 6 (* 6 .cse42)))) (+ (* 2 .cse58) (let ((.cse59 (+ .cse60 .cse35))) (+ (+ (* .cse59 .cse58) .cse47) (- (* .cse59 12)))))))) .cse61))) (or (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse55 .cse32 .cse9 .cse11 .cse12 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse29 .cse52 (= (+ 6 (+ 6 12)) |ULTIMATE.start_main_~z~0#1|) .cse56) (and .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse55 .cse9 .cse11 .cse12 (or .cse57 .cse46) .cse52 .cse56)))))) (.cse25 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse28 (not (<= .cse54 |ULTIMATE.start_main_~a~0#1|))) (.cse30 (<= .cse53 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse2 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse2) (= |ULTIMATE.start_main_~n~0#1| .cse2) .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse8 1)) .cse9 (<= .cse10 1) .cse11 (<= |ULTIMATE.start_main_~n~0#1| .cse2) .cse12 .cse13 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse8 6))) (let ((.cse14 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ .cse14 8)) .cse15 .cse16 .cse3 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse17 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse17 65536) (<= 2 .cse17) (= (+ .cse18 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse17)) .cse19)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse17) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse21 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse20 (+ 65536 .cse21))) (and (<= 0 .cse20) (<= 2 .cse21) (= (+ .cse18 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse21)) .cse19)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse20 65536)))))) .cse22 .cse6 .cse23 .cse11 .cse24 .cse25 (let ((.cse26 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse26 .cse13) (let ((.cse27 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse27 65536) (<= 0 .cse27) (not .cse26))))) .cse28 (= (+ 7 (+ (- 6) 18)) .cse14) .cse29 .cse30)) (let ((.cse41 (+ .cse33 .cse35)) (.cse40 (+ .cse33 6))) (and (or (not .cse31) .cse32 (= (+ (+ (+ (+ (+ (- (* .cse33 (* 3 .cse34))) (* (* 2 .cse35) .cse35)) .cse36) (- (* .cse35 10))) (* .cse33 3)) (- 10)) 0)) .cse15 .cse16 .cse3 .cse22 .cse6 .cse23 (let ((.cse39 (+ .cse40 6)) (.cse38 (+ .cse41 .cse44))) (or (= (+ (+ (let ((.cse37 (+ .cse40 .cse41))) (+ (- (* .cse37 10)) (+ (- (* .cse38 18)) (+ (- (* .cse39 (* .cse38 3))) (* .cse37 (* .cse37 2)))))) (* .cse39 3)) (- 10)) 0) (not (<= .cse42 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse38 12) (+ (- (* .cse39 .cse38)) (* .cse38 .cse43))) 0)))) .cse11 .cse24 .cse25 .cse28 (or (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse45 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0) (not .cse46)) .cse30 (or (= (+ (- 10) (+ (* .cse40 3) (+ (+ (+ (- (* .cse40 (* 3 .cse44))) (* (* 2 .cse41) .cse41)) .cse47) (- (* .cse41 10))))) 0) (not (= (+ (+ (- (* .cse40 .cse44)) (* .cse43 .cse44)) (* 12 .cse44)) 0)) (not (<= .cse48 |ULTIMATE.start_main_~a~0#1|))))) (let ((.cse51 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse50 (+ 6 6))) (and (= .cse49 (+ 6 1)) .cse46 .cse3 .cse4 .cse0 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse49 1)) .cse6 (= .cse50 .cse51) .cse7 .cse32 .cse9 (= (+ 6 .cse51) |ULTIMATE.start_main_~z~0#1|) .cse11 .cse12 .cse52 (= .cse50 .cse8) .cse30 (= 0 (+ (- 1) .cse53))))))))) [2023-02-18 01:21:52,515 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_main_~x~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse4 (= 6 |ULTIMATE.start_main_~z~0#1|)) (.cse2 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse0 (let ((.cse5 (let ((.cse6 (let ((.cse8 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse8 (let ((.cse10 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse9 (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse8) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse9) (or (not .cse9) (not (<= (+ .cse10 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 (+ |ULTIMATE.start_main_~z~0#1| (- 6)))) .cse2))))))) (or (and .cse6 (= (+ (let ((.cse7 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse7 (* .cse7 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (and .cse6 .cse1 .cse2 .cse4))))) (or (and (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))) .cse5) (and .cse2 .cse3 .cse5 .cse4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ (- 6) (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 12)) (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0))))) [2023-02-18 01:21:52,516 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse38 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse41 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse18 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse27 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse48 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse28 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse17 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse19 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse12 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse49 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse13 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) (let ((.cse32 (= (+ .cse12 (+ (* |ULTIMATE.start_main_~x~0#1| .cse49) .cse13)) 0)) (.cse10 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse17 .cse19) (and (or (not .cse17) (not .cse19)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse1 (= (+ (- 6) (+ (+ .cse48 (+ .cse28 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse2 (or .cse18 (let ((.cse52 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse51 (<= (+ .cse52 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse18) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse51) (or (not .cse51) (not (<= (+ .cse52 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse27))))) (.cse3 (= (+ (let ((.cse50 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse50 (* .cse50 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse5 (= .cse38 (* .cse41 (* .cse41 .cse41)))) (.cse6 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse45 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse35 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse43 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse31 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse30 (let ((.cse46 (or .cse35 (= (+ (+ (- (* .cse43 .cse38)) (* .cse38 .cse49)) (* .cse38 12)) 0) (< .cse41 (+ |ULTIMATE.start_main_~a~0#1| 1)))) (.cse47 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse48 .cse45))) 0))) (or (and .cse10 .cse1 .cse2 .cse3 .cse17 .cse46 .cse5 .cse19 .cse6 .cse47) (and .cse32 .cse10 .cse1 .cse2 .cse3 .cse17 .cse46 .cse5 .cse19 .cse6 .cse47)))) (.cse25 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse44 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse29 (+ (* (- 1) .cse4) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse8 (= (+ (+ (- (* .cse4 6)) (+ (* .cse4 .cse4) (- (* .cse29 12)))) 12) 0)) (.cse9 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse45 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse16 (<= (+ (- 1) .cse44) |ULTIMATE.start_main_~a~0#1|)) (.cse20 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse23 (not (<= .cse44 |ULTIMATE.start_main_~a~0#1|))) (.cse24 (let ((.cse40 (+ 6 (* .cse41 6)))) (let ((.cse42 (not (= .cse40 .cse43))) (.cse39 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse33 (or .cse42 (= (+ (+ (+ (- (* .cse39 12)) (+ (- (* .cse38 18)) (* .cse40 .cse39))) (* .cse40 2)) (- 6)) 0))) (.cse34 (or (= 0 (+ (- 6) (let ((.cse36 (+ 6 (* 6 (+ .cse41 1))))) (+ (* 2 .cse36) (let ((.cse37 (+ .cse40 .cse39))) (+ (+ (* .cse37 .cse36) (- (* 18 (+ .cse38 .cse39)))) (- (* .cse37 12)))))))) .cse42))) (or (and .cse32 .cse10 .cse1 .cse17 .cse33 .cse19 .cse30 .cse34) (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse10 .cse1 .cse17 .cse33 .cse35 .cse19 .cse30 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse25 (= (+ 6 (+ 6 12)) |ULTIMATE.start_main_~z~0#1|) .cse34)))))) (.cse26 (<= .cse31 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse0 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse0) (= |ULTIMATE.start_main_~n~0#1| .cse0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) .cse5 .cse6 (= .cse4 6))) (let ((.cse7 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ .cse7 8)) .cse8 .cse9 .cse10 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse11 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse11 65536) (<= 2 .cse11) (= (+ .cse12 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse11)) .cse13)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse11) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse15 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse14 (+ 65536 .cse15))) (and (<= 0 .cse14) (<= 2 .cse15) (= (+ .cse12 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse15)) .cse13)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse14 65536)))))) .cse16 .cse17 .cse18 .cse19 .cse20 (let ((.cse21 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse21 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (let ((.cse22 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse22 65536) (<= 0 .cse22) (not .cse21))))) .cse23 .cse24 (= (+ 7 (+ (- 6) 18)) .cse7) .cse25 .cse26)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse27 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse8 .cse9 .cse10 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse28 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse24 .cse26) (and (= .cse29 (+ 6 1)) .cse10 (= |ULTIMATE.start_main_~x~0#1| (+ .cse29 1)) .cse17 .cse19 .cse30 (= (+ 6 6) .cse4) (= 0 (+ (- 1) .cse31)))))))) [2023-02-18 01:21:52,531 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse33 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse43 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse34 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse35 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse44 (+ .cse34 .cse35)) (.cse61 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse32 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse31 (= (+ (+ (- (* .cse33 .cse34)) (* .cse34 .cse43)) (* .cse34 12)) 0)) (.cse48 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse10 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse23 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse8 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse1 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse62 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse45 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse6 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse11 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse18 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse19 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|)))) (let ((.cse53 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse46 (= (+ .cse18 (+ (* |ULTIMATE.start_main_~x~0#1| .cse43) .cse19)) 0)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse6 .cse11) (and (or (not .cse6) (not .cse11)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (= (+ (- 6) (+ (+ .cse62 (+ .cse45 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse0 (or .cse23 (let ((.cse65 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse64 (<= (+ .cse65 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse23) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse64) (or (not .cse64) (not (<= (+ .cse65 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse8)) .cse1))))) (.cse5 (= (+ (let ((.cse63 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse63 (* .cse63 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse7 (or .cse32 .cse31 (< .cse48 .cse10))) (.cse9 (= .cse34 (* .cse48 (* .cse48 .cse48)))) (.cse12 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse29 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse52 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse62 .cse61))) 0)) (.cse47 (- (* 18 .cse44))) (.cse42 (+ .cse48 1)) (.cse36 (- (* .cse34 18))) (.cse54 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse49 (+ (* (- 1) .cse8) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse15 (= (+ (+ (- (* .cse8 6)) (+ (* .cse8 .cse8) (- (* .cse49 12)))) 12) 0)) (.cse16 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse61 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse22 (<= (+ (- 1) .cse54) |ULTIMATE.start_main_~a~0#1|)) (.cse24 (let ((.cse59 (+ 6 (* .cse48 6)))) (let ((.cse60 (not (= .cse59 .cse33)))) (let ((.cse55 (or .cse60 (= (+ (+ (+ (- (* .cse35 12)) (+ .cse36 (* .cse59 .cse35))) (* .cse59 2)) (- 6)) 0))) (.cse56 (or (= 0 (+ (- 6) (let ((.cse57 (+ 6 (* 6 .cse42)))) (+ (* 2 .cse57) (let ((.cse58 (+ .cse59 .cse35))) (+ (+ (* .cse58 .cse57) .cse47) (- (* .cse58 12)))))))) .cse60))) (or (and .cse46 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse55 .cse9 .cse11 .cse12 .cse52 .cse56) (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse55 .cse32 .cse9 .cse11 .cse12 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse29 .cse52 (= (+ 6 (+ 6 12)) |ULTIMATE.start_main_~z~0#1|) .cse56)))))) (.cse25 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse28 (not (<= .cse54 |ULTIMATE.start_main_~a~0#1|))) (.cse30 (<= .cse53 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~y~0#1| 1) .cse1 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse2 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse2) (= |ULTIMATE.start_main_~n~0#1| .cse2) .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse8 1)) .cse9 (<= .cse10 1) .cse11 (<= |ULTIMATE.start_main_~n~0#1| .cse2) .cse12 .cse13 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse8 6))) (let ((.cse14 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ .cse14 8)) .cse15 .cse16 .cse3 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse17 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse17 65536) (<= 2 .cse17) (= (+ .cse18 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse17)) .cse19)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse17) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse21 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse20 (+ 65536 .cse21))) (and (<= 0 .cse20) (<= 2 .cse21) (= (+ .cse18 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse21)) .cse19)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse20 65536)))))) .cse22 .cse6 .cse23 .cse11 .cse24 .cse25 (let ((.cse26 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse26 .cse13) (let ((.cse27 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse27 65536) (<= 0 .cse27) (not .cse26))))) .cse28 (= (+ 7 (+ (- 6) 18)) .cse14) .cse29 .cse30)) (let ((.cse41 (+ .cse33 .cse35)) (.cse40 (+ .cse33 6))) (and (or (not .cse31) .cse32 (= (+ (+ (+ (+ (+ (- (* .cse33 (* 3 .cse34))) (* (* 2 .cse35) .cse35)) .cse36) (- (* .cse35 10))) (* .cse33 3)) (- 10)) 0)) .cse15 .cse16 .cse3 .cse22 .cse6 .cse23 (let ((.cse39 (+ .cse40 6)) (.cse38 (+ .cse41 .cse44))) (or (= (+ (+ (let ((.cse37 (+ .cse40 .cse41))) (+ (- (* .cse37 10)) (+ (- (* .cse38 18)) (+ (- (* .cse39 (* .cse38 3))) (* .cse37 (* .cse37 2)))))) (* .cse39 3)) (- 10)) 0) (not (<= .cse42 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse38 12) (+ (- (* .cse39 .cse38)) (* .cse38 .cse43))) 0)))) .cse11 .cse24 .cse25 .cse28 (or (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse45 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0) (not .cse46)) .cse30 (or (= (+ (- 10) (+ (* .cse40 3) (+ (+ (+ (- (* .cse40 (* 3 .cse44))) (* (* 2 .cse41) .cse41)) .cse47) (- (* .cse41 10))))) 0) (not (= (+ (+ (- (* .cse40 .cse44)) (* .cse43 .cse44)) (* 12 .cse44)) 0)) (not (<= .cse48 |ULTIMATE.start_main_~a~0#1|))))) (let ((.cse51 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse50 (+ 6 6))) (and (= .cse49 (+ 6 1)) .cse46 .cse3 .cse4 .cse0 .cse5 (= |ULTIMATE.start_main_~x~0#1| (+ .cse49 1)) .cse6 (= .cse50 .cse51) .cse7 .cse32 .cse9 (= (+ 6 .cse51) |ULTIMATE.start_main_~z~0#1|) .cse11 .cse12 .cse52 (= .cse50 .cse8) .cse30 (= 0 (+ (- 1) .cse53))))))))) [2023-02-18 01:21:52,531 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2023-02-18 01:21:52,531 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 01:21:52,531 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 56) the Hoare annotation is: true [2023-02-18 01:21:52,531 INFO L899 garLoopResultBuilder]: For program point L38(lines 33 46) no Hoare annotation was computed. [2023-02-18 01:21:52,532 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse6 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse44 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse11 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse68 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse45 (+ .cse68 .cse63)) (.cse66 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse67 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse55 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse36 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse71 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse47 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse73 (not .cse11)) (.cse30 (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| .cse44) .cse7)) 0)) (.cse31 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse76 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse46 (* 2 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse37 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse76 (+ (* .cse46 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse25 (or .cse73 .cse30 .cse31)) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse10 .cse12) (and (or (not .cse10) (not .cse12)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse52 (= (+ (- 6) (+ (+ .cse71 (+ .cse76 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse47)) 0)) (.cse23 (or .cse11 (let ((.cse75 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse74 (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse73 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse74) (or (not .cse74) (not (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse36)) .cse49))))) (.cse24 (= (+ (let ((.cse72 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse72 (* .cse72 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse32 (= .cse68 (* .cse55 (* .cse55 .cse55)))) (.cse33 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse15 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse35 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse71 .cse67))) 0)) (.cse29 (+ 6 12)) (.cse43 (+ .cse55 1)) (.cse20 (+ (* (- 1) .cse36) |ULTIMATE.start_main_~y~0#1|)) (.cse54 (= (+ (+ (- (* .cse66 .cse68)) (* .cse68 .cse44)) (* .cse68 12)) 0)) (.cse53 (not .cse31)) (.cse65 (- (* .cse68 18))) (.cse50 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse34 (+ 0 1)) (.cse61 (- (* 18 .cse45))) (.cse42 (+ .cse66 .cse63)) (.cse41 (+ .cse66 6))) (let ((.cse19 (or (= (+ (- 10) (+ (* .cse41 3) (+ (+ (+ (- (* .cse41 (* 3 .cse45))) (* (* 2 .cse42) .cse42)) .cse61) (- (* .cse42 10))))) 0) (not (= (+ (+ (- (* .cse41 .cse45)) (* .cse44 .cse45)) (* 12 .cse45)) 0)) (not (<= .cse55 |ULTIMATE.start_main_~a~0#1|)))) (.cse22 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse21 (+ 6 1)) (.cse26 (+ 6 6)) (.cse48 (<= |ULTIMATE.start_main_~n~0#1| .cse34)) (.cse14 (let ((.cse69 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse69 .cse50) (let ((.cse70 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse70 65536) (<= 0 .cse70) (not .cse69)))))) (.cse51 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse28 (* (- 1) 6)) (.cse17 (or (not .cse54) .cse53 (= (+ (+ (+ (+ (+ (- (* .cse66 (* 3 .cse68))) (* (* 2 .cse63) .cse63)) .cse65) (- (* .cse63 10))) (* .cse66 3)) (- 10)) 0))) (.cse2 (= (+ (+ (- (* .cse36 6)) (+ (* .cse36 .cse36) (- (* .cse20 12)))) 12) 0)) (.cse3 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse67 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse13 (let ((.cse62 (+ 6 (* .cse55 6)))) (let ((.cse64 (not (= .cse62 .cse66)))) (let ((.cse57 (or .cse64 (= (+ (+ (+ (- (* .cse63 12)) (+ .cse65 (* .cse62 .cse63))) (* .cse62 2)) (- 6)) 0))) (.cse58 (or (= 0 (+ (- 6) (let ((.cse59 (+ 6 (* 6 .cse43)))) (+ (* 2 .cse59) (let ((.cse60 (+ .cse62 .cse63))) (+ (+ (* .cse60 .cse59) .cse61) (- (* .cse60 12)))))))) .cse64))) (or (and .cse4 .cse52 .cse23 .cse24 .cse25 .cse10 .cse57 .cse32 .cse12 .cse33 .cse35 .cse58) (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse4 .cse52 .cse23 .cse24 .cse10 .cse57 .cse32 .cse12 .cse33 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse15 .cse35 (= (+ 6 .cse29) |ULTIMATE.start_main_~z~0#1|) .cse58)))))) (.cse18 (or .cse37 (not .cse30))) (.cse16 (<= .cse0 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse1 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (<= 2 .cse0) (= |ULTIMATE.start_main_~x~0#1| (+ .cse1 8)) .cse2 .cse3 .cse4 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse5 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse5 65536) (<= 2 .cse5) (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse5)) .cse7)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse5) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse9 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse8 (+ 65536 .cse9))) (and (<= 0 .cse8) (<= 2 .cse9) (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse9)) .cse7)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse8 65536)))))) .cse10 .cse11 .cse12 .cse13 .cse14 (= (+ 7 (+ (- 6) 18)) .cse1) .cse15 .cse16)) (and .cse17 .cse2 .cse3 .cse4 .cse10 (<= 4 .cse0) .cse11 .cse12 .cse13 .cse18 .cse16 .cse19) (let ((.cse27 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse20 .cse21) .cse2 (<= 7 .cse22) .cse3 (<= 7 (+ |ULTIMATE.start_main_~y~0#1| (- 12))) .cse4 .cse23 .cse24 (= |ULTIMATE.start_main_~x~0#1| (+ .cse20 1)) .cse25 .cse10 (= .cse26 .cse27) (= (+ (+ 7 .cse28) 0) (+ (* (- 1) 7) |ULTIMATE.start_main_~x~0#1|)) .cse11 (<= 1 .cse0) (= |ULTIMATE.start_main_~z~0#1| .cse29) (or .cse30 .cse31) .cse32 (= (+ 6 .cse27) |ULTIMATE.start_main_~z~0#1|) .cse12 .cse33 .cse14 (= .cse0 .cse34) .cse35 (= .cse26 .cse36) .cse16 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse36)) (= 0 (+ (- 1) .cse0)))) (and .cse17 .cse2 .cse3 .cse4 (<= 3 .cse0) .cse37 .cse10 .cse11 (let ((.cse40 (+ .cse41 6)) (.cse39 (+ .cse42 .cse45))) (or (= (+ (+ (let ((.cse38 (+ .cse41 .cse42))) (+ (- (* .cse38 10)) (+ (- (* .cse39 18)) (+ (- (* .cse40 (* .cse39 3))) (* .cse38 (* .cse38 2)))))) (* .cse40 3)) (- 10)) 0) (not (<= .cse43 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse39 12) (+ (- (* .cse40 .cse39)) (* .cse39 .cse44))) 0)))) .cse12 .cse13 .cse14 .cse16 .cse19) (and (= (+ (+ (+ (- .cse46) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse44))) .cse47) (- 10)) 0) .cse30 .cse2 .cse3 .cse4 .cse23 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) (>= |ULTIMATE.start_main_~y~0#1| 1) .cse11 (= |ULTIMATE.start_main_~y~0#1| 1) .cse12 .cse48 .cse49 .cse14 .cse50 .cse51 (>= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse56 (+ .cse28 |ULTIMATE.start_main_~y~0#1|))) (and (<= 0 .cse22) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 .cse3 (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse34) (= |ULTIMATE.start_main_~n~0#1| .cse34) (= |ULTIMATE.start_main_~y~0#1| .cse21) .cse4 .cse52 .cse23 .cse24 .cse25 (= .cse26 |ULTIMATE.start_main_~z~0#1|) .cse10 (or .cse53 .cse54 (< .cse55 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse36 1)) .cse32 .cse12 .cse48 .cse33 (<= 1 (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|)) .cse14 (= .cse56 1) (<= 0 .cse0) .cse50 .cse51 (= .cse36 6) .cse16 (= (+ .cse56 0) |ULTIMATE.start_main_~x~0#1|))) (and .cse17 (<= 5 .cse0) .cse2 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 .cse18 .cse16)))))) [2023-02-18 01:21:52,533 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse30 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (let ((.cse38 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse53 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse39 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse19 (not .cse30)) (.cse24 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse57 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse72 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse68 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse29 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse54 (+ .cse72 .cse68)) (.cse73 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse75 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse60 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse56 (or .cse30 (let ((.cse80 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse79 (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse19 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse79) (or (not .cse79) (not (<= (+ .cse80 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse24)) .cse57))))) (.cse8 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse16 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse14 (= (+ .cse38 (+ (* |ULTIMATE.start_main_~x~0#1| .cse53) .cse39)) 0)) (.cse15 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse74 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse76 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse71 (+ 6 |ULTIMATE.start_main_~z~0#1|))) (let ((.cse12 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse33 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse22 (+ 0 1)) (.cse0 (+ (* (- 1) .cse24) |ULTIMATE.start_main_~y~0#1|)) (.cse51 (+ .cse71 .cse68)) (.cse50 (+ .cse71 6)) (.cse55 (= (+ (+ (+ (- .cse74) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse53))) .cse76) (- 10)) 0)) (.cse7 (or .cse19 .cse14 .cse15)) (.cse42 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse13 (+ 6 12)) (.cse5 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse8 .cse16) (and (or (not .cse8) (not .cse16)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse17 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse18 (let ((.cse77 (= (+ (let ((.cse78 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse78 (* .cse78 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse56 .cse77) (and .cse56 (or .cse19 .cse77))))) (.cse23 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse75 .cse60))) 0)) (.cse26 (= (+ (- 6) (+ (+ .cse75 (+ .cse73 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse76)) 0)) (.cse61 (- (* 18 .cse54))) (.cse52 (+ .cse29 1)) (.cse28 (= (+ (+ (- (* .cse71 .cse72)) (* .cse72 .cse53)) (* .cse72 12)) 0)) (.cse27 (not .cse15)) (.cse70 (- (* .cse72 18))) (.cse46 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse73 (+ (* .cse74 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0))) (let ((.cse3 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse1 (+ 6 1)) (.cse9 (+ 6 6)) (.cse20 (= .cse72 (* .cse29 (* .cse29 .cse29)))) (.cse11 (* (- 1) 6)) (.cse44 (or .cse46 (not .cse14))) (.cse43 (or (not .cse28) .cse27 (= (+ (+ (+ (+ (+ (- (* .cse71 (* 3 .cse72))) (* (* 2 .cse68) .cse68)) .cse70) (- (* .cse68 10))) (* .cse71 3)) (- 10)) 0))) (.cse36 (let ((.cse62 (let ((.cse67 (+ 6 (* .cse29 6)))) (let ((.cse69 (not (= .cse67 .cse71)))) (let ((.cse63 (or .cse69 (= (+ (+ (+ (- (* .cse68 12)) (+ .cse70 (* .cse67 .cse68))) (* .cse67 2)) (- 6)) 0))) (.cse64 (or (= 0 (+ (- 6) (let ((.cse65 (+ 6 (* 6 .cse52)))) (+ (* 2 .cse65) (let ((.cse66 (+ .cse67 .cse68))) (+ (+ (* .cse66 .cse65) .cse61) (- (* .cse66 12)))))))) .cse69))) (or (and .cse5 .cse26 .cse8 .cse63 .cse16 .cse17 .cse18 .cse23 .cse64) (and .cse5 .cse8 .cse63 .cse16 .cse17 .cse18 .cse23 .cse64 (or .cse19 .cse26)))))))) (or (and .cse62 .cse7) (and .cse62 (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse42 (= (+ 6 .cse13) |ULTIMATE.start_main_~z~0#1|))))) (.cse6 (or .cse55 .cse15)) (.cse45 (or (= (+ (- 10) (+ (* .cse50 3) (+ (+ (+ (- (* .cse50 (* 3 .cse54))) (* (* 2 .cse51) .cse51)) .cse61) (- (* .cse51 10))))) 0) (not (= (+ (+ (- (* .cse50 .cse54)) (* .cse53 .cse54)) (* 12 .cse54)) 0)) (not (<= .cse29 |ULTIMATE.start_main_~a~0#1|)))) (.cse2 (= (+ (+ (- (* .cse24 6)) (+ (* .cse24 .cse24) (- (* .cse0 12)))) 12) 0)) (.cse4 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse60 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse31 (<= |ULTIMATE.start_main_~n~0#1| .cse22)) (.cse21 (let ((.cse58 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse58 .cse33) (let ((.cse59 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse59 65536) (<= 0 .cse59) (not .cse58)))))) (.cse34 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse25 (<= .cse12 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse10 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse0 .cse1) .cse2 (<= 7 .cse3) .cse4 (<= 7 (+ |ULTIMATE.start_main_~y~0#1| (- 12))) .cse5 .cse6 (= |ULTIMATE.start_main_~x~0#1| (+ .cse0 1)) .cse7 .cse8 (= .cse9 .cse10) (= (+ (+ 7 .cse11) 0) (+ (* (- 1) 7) |ULTIMATE.start_main_~x~0#1|)) (<= 1 .cse12) (= |ULTIMATE.start_main_~z~0#1| .cse13) (or .cse14 .cse15) (= (+ 6 .cse10) |ULTIMATE.start_main_~z~0#1|) .cse16 .cse17 .cse18 (or .cse19 .cse20) .cse21 (= .cse12 .cse22) .cse23 (= .cse9 .cse24) .cse25 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse24)) (= 0 (+ (- 1) .cse12)))) (let ((.cse32 (+ .cse11 |ULTIMATE.start_main_~y~0#1|))) (and (<= 0 .cse3) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 .cse4 (= .cse12 0) (= |ULTIMATE.start_main_~x~0#1| .cse22) (= |ULTIMATE.start_main_~n~0#1| .cse22) (= |ULTIMATE.start_main_~y~0#1| .cse1) .cse5 .cse26 .cse7 (= .cse9 |ULTIMATE.start_main_~z~0#1|) .cse8 (or .cse27 .cse28 (< .cse29 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse30 (= |ULTIMATE.start_main_~y~0#1| (+ .cse24 1)) .cse20 .cse16 .cse31 (<= 1 (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|)) .cse18 .cse21 (= .cse32 1) (<= 0 .cse12) .cse33 .cse34 (= .cse24 6) .cse25 (= (+ .cse32 0) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse35 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (<= 2 .cse12) (= |ULTIMATE.start_main_~x~0#1| (+ .cse35 8)) .cse2 .cse4 .cse36 .cse5 .cse6 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse37 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse37 65536) (<= 2 .cse37) (= (+ .cse38 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse37)) .cse39)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse37) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse41 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse40 (+ 65536 .cse41))) (and (<= 0 .cse40) (<= 2 .cse41) (= (+ .cse38 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse41)) .cse39)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse40 65536)))))) .cse8 .cse16 .cse21 (= (+ 7 (+ (- 6) 18)) .cse35) .cse42 .cse25)) (and .cse43 (<= 5 .cse12) .cse2 .cse4 .cse36 .cse5 .cse6 .cse8 .cse16 .cse44 .cse25) (and .cse43 .cse2 .cse4 .cse36 .cse5 .cse6 .cse8 (<= 4 .cse12) .cse16 .cse44 .cse25 .cse45) (and .cse43 .cse2 .cse4 .cse36 .cse5 (<= 3 .cse12) .cse6 .cse46 .cse8 (let ((.cse49 (+ .cse50 6)) (.cse48 (+ .cse51 .cse54))) (or (= (+ (+ (let ((.cse47 (+ .cse50 .cse51))) (+ (- (* .cse47 10)) (+ (- (* .cse48 18)) (+ (- (* .cse49 (* .cse48 3))) (* .cse47 (* .cse47 2)))))) (* .cse49 3)) (- 10)) 0) (not (<= .cse52 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse48 12) (+ (- (* .cse49 .cse48)) (* .cse48 .cse53))) 0)))) .cse16 .cse21 .cse25 .cse45) (and .cse55 .cse14 .cse2 .cse4 .cse5 .cse56 .cse8 (>= |ULTIMATE.start_main_~n~0#1| 0) (>= |ULTIMATE.start_main_~y~0#1| 1) .cse30 (= |ULTIMATE.start_main_~y~0#1| 1) .cse16 .cse31 .cse57 .cse21 .cse33 .cse34 (>= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) .cse25 (= 6 |ULTIMATE.start_main_~z~0#1|)))))))) [2023-02-18 01:21:52,534 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse52 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse38 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse53 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse70 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse65 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse39 (+ .cse70 .cse65)) (.cse68 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse47 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse22 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse69 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse43 (= (+ .cse52 (+ (* |ULTIMATE.start_main_~x~0#1| .cse38) .cse53)) 0)) (.cse44 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse73 (not .cse7)) (.cse23 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse72 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse71 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse48 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse8 (>= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse6 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse28 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse56 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse42 (+ 6 12)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse5 .cse8) (and (or (not .cse5) (not .cse8)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse15 (= (+ (- 6) (+ (+ .cse72 (+ .cse71 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse48)) 0)) (.cse16 (or .cse7 (let ((.cse76 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse75 (<= (+ .cse76 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse73 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse75) (or (not .cse75) (not (<= (+ .cse76 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse23)) .cse49))))) (.cse17 (= (+ (let ((.cse74 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse74 (* .cse74 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse18 (or .cse73 .cse43 .cse44)) (.cse45 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse46 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse72 .cse69))) 0)) (.cse37 (+ .cse22 1)) (.cse40 (+ (* (- 1) .cse23) |ULTIMATE.start_main_~y~0#1|)) (.cse13 (+ 0 1)) (.cse31 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse71 (+ (* .cse47 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse21 (= (+ (+ (- (* .cse68 .cse70)) (* .cse70 .cse38)) (* .cse70 12)) 0)) (.cse20 (not .cse44)) (.cse67 (- (* .cse70 18))) (.cse63 (- (* 18 .cse39))) (.cse36 (+ .cse68 .cse65)) (.cse35 (+ .cse68 6))) (let ((.cse11 (or (= (+ (- 10) (+ (* .cse35 3) (+ (+ (+ (- (* .cse35 (* 3 .cse39))) (* (* 2 .cse36) .cse36)) .cse63) (- (* .cse36 10))))) 0) (not (= (+ (+ (- (* .cse35 .cse39)) (* .cse38 .cse39)) (* 12 .cse39)) 0)) (not (<= .cse22 |ULTIMATE.start_main_~a~0#1|)))) (.cse0 (or (not .cse21) .cse20 (= (+ (+ (+ (+ (+ (- (* .cse68 (* 3 .cse70))) (* (* 2 .cse65) .cse65)) .cse67) (- (* .cse65 10))) (* .cse68 3)) (- 10)) 0))) (.cse9 (or .cse31 (not .cse43))) (.cse14 (+ 6 1)) (.cse12 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse30 (* (- 1) 6)) (.cse24 (= .cse70 (* .cse22 (* .cse22 .cse22)))) (.cse19 (+ 6 6)) (.cse25 (<= |ULTIMATE.start_main_~n~0#1| .cse13)) (.cse29 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse1 (= (+ (+ (- (* .cse23 6)) (+ (* .cse23 .cse23) (- (* .cse40 12)))) 12) 0)) (.cse2 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse69 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse4 (let ((.cse64 (+ 6 (* .cse22 6)))) (let ((.cse66 (not (= .cse64 .cse68)))) (let ((.cse59 (or .cse66 (= (+ (+ (+ (- (* .cse65 12)) (+ .cse67 (* .cse64 .cse65))) (* .cse64 2)) (- 6)) 0))) (.cse60 (or (= 0 (+ (- 6) (let ((.cse61 (+ 6 (* 6 .cse37)))) (+ (* 2 .cse61) (let ((.cse62 (+ .cse64 .cse65))) (+ (+ (* .cse62 .cse61) .cse63) (- (* .cse62 12)))))))) .cse66))) (or (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse3 .cse15 .cse16 .cse17 .cse5 .cse59 .cse8 .cse45 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse56 .cse46 (= (+ 6 .cse42) |ULTIMATE.start_main_~z~0#1|) .cse60) (and .cse3 .cse15 .cse16 .cse17 .cse18 .cse5 .cse59 .cse8 .cse45 .cse46 .cse60)))))) (.cse26 (let ((.cse57 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse57 .cse28) (let ((.cse58 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse58 65536) (<= 0 .cse58) (not .cse57)))))) (.cse10 (<= .cse6 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 4 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse27 (+ .cse30 |ULTIMATE.start_main_~y~0#1|))) (and (<= 0 .cse12) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse1 .cse2 (= .cse6 0) (= |ULTIMATE.start_main_~x~0#1| .cse13) (= |ULTIMATE.start_main_~n~0#1| .cse13) (= |ULTIMATE.start_main_~y~0#1| .cse14) .cse3 .cse15 .cse16 .cse17 .cse18 (= .cse19 |ULTIMATE.start_main_~z~0#1|) .cse5 (or .cse20 .cse21 (< .cse22 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse7 (= |ULTIMATE.start_main_~y~0#1| (+ .cse23 1)) .cse24 .cse8 .cse25 (<= 1 (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|)) .cse26 (= .cse27 1) (<= 0 .cse6) .cse28 .cse29 (= .cse23 6) .cse10 (= (+ .cse27 0) |ULTIMATE.start_main_~x~0#1|))) (and .cse0 .cse1 .cse2 .cse3 (<= 3 .cse6) .cse4 .cse31 .cse5 .cse7 (let ((.cse34 (+ .cse35 6)) (.cse33 (+ .cse36 .cse39))) (or (= (+ (+ (let ((.cse32 (+ .cse35 .cse36))) (+ (- (* .cse32 10)) (+ (- (* .cse33 18)) (+ (- (* .cse34 (* .cse33 3))) (* .cse32 (* .cse32 2)))))) (* .cse34 3)) (- 10)) 0) (not (<= .cse37 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse33 12) (+ (- (* .cse34 .cse33)) (* .cse33 .cse38))) 0)))) .cse8 .cse26 .cse10 .cse11) (and .cse0 (<= 5 .cse6) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (let ((.cse41 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse40 .cse14) .cse1 (<= 7 .cse12) .cse2 (<= 7 (+ |ULTIMATE.start_main_~y~0#1| (- 12))) .cse3 .cse16 .cse17 (= |ULTIMATE.start_main_~x~0#1| (+ .cse40 1)) .cse18 .cse5 (= .cse19 .cse41) (= (+ (+ 7 .cse30) 0) (+ (* (- 1) 7) |ULTIMATE.start_main_~x~0#1|)) .cse7 (<= 1 .cse6) (= |ULTIMATE.start_main_~z~0#1| .cse42) (or .cse43 .cse44) .cse24 (= (+ 6 .cse41) |ULTIMATE.start_main_~z~0#1|) .cse8 .cse45 .cse26 (= .cse6 .cse13) .cse46 (= .cse19 .cse23) .cse10 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse23)) (= 0 (+ (- 1) .cse6)))) (and (= (+ (+ (+ (- .cse47) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse38))) .cse48) (- 10)) 0) .cse43 .cse1 .cse2 .cse3 .cse16 .cse5 (>= |ULTIMATE.start_main_~n~0#1| 0) (>= |ULTIMATE.start_main_~y~0#1| 1) .cse7 (= |ULTIMATE.start_main_~y~0#1| 1) .cse8 .cse25 .cse49 .cse26 .cse28 .cse29 (>= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) .cse10 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse50 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (<= 2 .cse6) (= |ULTIMATE.start_main_~x~0#1| (+ .cse50 8)) .cse1 .cse2 .cse3 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse51 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse51 65536) (<= 2 .cse51) (= (+ .cse52 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse51)) .cse53)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse51) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse55 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse54 (+ 65536 .cse55))) (and (<= 0 .cse54) (<= 2 .cse55) (= (+ .cse52 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse55)) .cse53)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse54 65536)))))) .cse4 .cse5 .cse7 .cse8 .cse26 (= (+ 7 (+ (- 6) 18)) .cse50) .cse56 .cse10))))))) [2023-02-18 01:21:52,535 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 01:21:52,535 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 01:21:52,535 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-02-18 01:21:52,535 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse3 (= |ULTIMATE.start_main_~n~0#1| 0))) (let ((.cse2 (let ((.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|))))) (or .cse12 (let ((.cse14 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse13 (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse13) (or (not .cse13) (not (<= (+ .cse14 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse4)) .cse3)))))) (.cse1 (- (* |ULTIMATE.start_main_~y~0#1| 12)))) (let ((.cse0 (let ((.cse6 (= (+ (- 6) (+ (+ .cse1 (+ (- (* |ULTIMATE.start_main_~x~0#1| 18)) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse7 (= (+ (let ((.cse11 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse11 (* .cse11 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (let ((.cse10 (+ |ULTIMATE.start_main_~n~0#1| 1))) (* .cse10 (* .cse10 .cse10))))) (.cse9 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|))))) (or (let ((.cse5 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse5) (= |ULTIMATE.start_main_~n~0#1| .cse5) .cse6 .cse2 .cse7 .cse8 .cse9)) (and .cse6 .cse2 .cse7 .cse8 .cse9))))) (or (and .cse0 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse1 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)))) 0)) (and .cse2 (= |ULTIMATE.start_main_~y~0#1| 1) .cse3 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (+ .cse4 1)) (= .cse4 6)))))) [2023-02-18 01:21:52,536 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse2 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse19 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse3 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse0 (= (+ (+ (- (* .cse2 .cse3)) (* .cse3 .cse19)) (* .cse3 12)) 0)) (.cse27 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse51 (+ |ULTIMATE.start_main_~a~0#1| 1)) (.cse12 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse32 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse45 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse63 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse9 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse11 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse21 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse36 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse37 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse4 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse20 (+ .cse3 .cse4)) (.cse53 (= (+ .cse36 (+ (* |ULTIMATE.start_main_~x~0#1| .cse19) .cse37)) 0)) (.cse8 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse11 .cse21) (and (or (not .cse11) (not .cse21)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse47 (= (+ (- 6) (+ (+ .cse63 (+ .cse9 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (* 2 |ULTIMATE.start_main_~z~0#1|))) 0)) (.cse44 (or .cse12 (let ((.cse66 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse65 (<= (+ .cse66 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and (not .cse12) (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse65) (or (not .cse65) (not (<= (+ .cse66 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse32)) .cse45))))) (.cse48 (= (+ (let ((.cse64 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse64 (* .cse64 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse49 (or .cse1 .cse0 (< .cse27 .cse51))) (.cse50 (= .cse3 (* .cse27 (* .cse27 .cse27)))) (.cse52 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse61 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse33 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse31 (let ((.cse62 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse63 .cse61))) 0))) (or (and .cse8 .cse47 .cse44 .cse48 .cse11 .cse49 .cse50 .cse21 .cse52 .cse62) (and .cse53 .cse8 .cse47 .cse44 .cse48 .cse11 .cse49 .cse50 .cse21 .cse52 .cse62)))) (.cse43 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse26 (- (* 18 .cse20))) (.cse18 (+ .cse27 1)) (.cse5 (- (* .cse3 18))) (.cse60 (+ (- 1) (div (- |ULTIMATE.start_main_~z~0#1|) (- 6)))) (.cse28 (+ (* (- 1) .cse32) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse6 (= (+ (+ (- (* .cse32 6)) (+ (* .cse32 .cse32) (- (* .cse28 12)))) 12) 0)) (.cse7 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse61 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse10 (<= (+ (- 1) .cse60) |ULTIMATE.start_main_~a~0#1|)) (.cse22 (= (mod (* 5 |ULTIMATE.start_main_~z~0#1|) 6) 0)) (.cse23 (not (<= .cse60 |ULTIMATE.start_main_~a~0#1|))) (.cse24 (let ((.cse58 (+ 6 (* .cse27 6)))) (let ((.cse59 (not (= .cse58 .cse2)))) (let ((.cse54 (or .cse59 (= (+ (+ (+ (- (* .cse4 12)) (+ .cse5 (* .cse58 .cse4))) (* .cse58 2)) (- 6)) 0))) (.cse55 (or (= 0 (+ (- 6) (let ((.cse56 (+ 6 (* 6 .cse18)))) (+ (* 2 .cse56) (let ((.cse57 (+ .cse58 .cse4))) (+ (+ (* .cse57 .cse56) .cse26) (- (* .cse57 12)))))))) .cse59))) (or (and .cse53 .cse8 .cse47 .cse11 .cse54 .cse21 .cse31 .cse55) (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse8 .cse47 .cse11 .cse54 .cse1 .cse21 .cse31 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse43 (= (+ 6 (+ 6 12)) |ULTIMATE.start_main_~z~0#1|) .cse55)))))) (.cse25 (<= .cse33 |ULTIMATE.start_main_~a~0#1|)) (.cse41 (<= 0 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse17 (+ .cse2 .cse4)) (.cse16 (+ .cse2 6))) (and (or (not .cse0) .cse1 (= (+ (+ (+ (+ (+ (- (* .cse2 (* 3 .cse3))) (* (* 2 .cse4) .cse4)) .cse5) (- (* .cse4 10))) (* .cse2 3)) (- 10)) 0)) .cse6 .cse7 .cse8 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse9 (+ (* (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0) .cse10 .cse11 .cse12 (let ((.cse15 (+ .cse16 6)) (.cse14 (+ .cse17 .cse20))) (or (= (+ (+ (let ((.cse13 (+ .cse16 .cse17))) (+ (- (* .cse13 10)) (+ (- (* .cse14 18)) (+ (- (* .cse15 (* .cse14 3))) (* .cse13 (* .cse13 2)))))) (* .cse15 3)) (- 10)) 0) (not (<= .cse18 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse14 12) (+ (- (* .cse15 .cse14)) (* .cse14 .cse19))) 0)))) .cse21 .cse22 .cse23 .cse24 .cse25 (or (= (+ (- 10) (+ (* .cse16 3) (+ (+ (+ (- (* .cse16 (* 3 .cse20))) (* (* 2 .cse17) .cse17)) .cse26) (- (* .cse17 10))))) 0) (not (= (+ (+ (- (* .cse16 .cse20)) (* .cse19 .cse20)) (* 12 .cse20)) 0)) (not (<= .cse27 |ULTIMATE.start_main_~a~0#1|))))) (let ((.cse30 (+ (- 7) |ULTIMATE.start_main_~y~0#1|)) (.cse29 (+ 6 6))) (and (= .cse28 (+ 6 1)) .cse8 (= |ULTIMATE.start_main_~x~0#1| (+ .cse28 1)) .cse11 (= .cse29 .cse30) .cse1 (= (+ 6 .cse30) |ULTIMATE.start_main_~z~0#1|) .cse21 .cse31 (= .cse29 .cse32) .cse25 (= 0 (+ (- 1) .cse33)))) (let ((.cse34 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| (+ .cse34 8)) .cse6 .cse7 .cse8 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse35 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse35 65536) (<= 2 .cse35) (= (+ .cse36 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse35)) .cse37)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse35) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse39 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse38 (+ 65536 .cse39))) (and (<= 0 .cse38) (<= 2 .cse39) (= (+ .cse36 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse39)) .cse37)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse38 65536)))))) .cse10 .cse11 .cse12 .cse21 .cse22 (let ((.cse40 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse40 .cse41) (let ((.cse42 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse42 65536) (<= 0 .cse42) (not .cse40))))) .cse23 .cse24 (= (+ 7 (+ (- 6) 18)) .cse34) .cse43 .cse25)) (and .cse44 (= |ULTIMATE.start_main_~y~0#1| 1) .cse45 (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse46 (+ 0 1))) (and (= |ULTIMATE.start_main_~x~0#1| .cse46) (= |ULTIMATE.start_main_~n~0#1| .cse46) .cse8 .cse47 .cse44 .cse48 .cse11 .cse49 (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (+ .cse32 1)) .cse50 (<= .cse51 1) .cse21 (<= |ULTIMATE.start_main_~n~0#1| .cse46) .cse52 .cse41 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6)) (= .cse32 6))))))))) [2023-02-18 01:21:52,536 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-02-18 01:21:52,537 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse6 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse42 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse11 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse68 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse43 (+ .cse68 .cse63)) (.cse66 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse67 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse54 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse34 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse49 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse71 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse56 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse47 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse73 (not .cse11)) (.cse28 (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| .cse42) .cse7)) 0)) (.cse29 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (let ((.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse46 (* 2 |ULTIMATE.start_main_~y~0#1|)) (.cse23 (or .cse73 .cse28 .cse29)) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse10 .cse12) (and (or (not .cse10) (not .cse12)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse20 (= (+ (- 6) (+ (+ .cse71 (+ .cse56 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse47)) 0)) (.cse21 (or .cse11 (let ((.cse75 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse74 (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse73 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse74) (or (not .cse74) (not (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse34)) .cse49))))) (.cse22 (= (+ (let ((.cse72 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse72 (* .cse72 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse30 (= .cse68 (* .cse54 (* .cse54 .cse54)))) (.cse31 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse15 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse33 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse71 .cse67))) 0)) (.cse27 (+ 6 12)) (.cse41 (+ .cse54 1)) (.cse17 (+ (* (- 1) .cse34) |ULTIMATE.start_main_~y~0#1|)) (.cse53 (= (+ (+ (- (* .cse66 .cse68)) (* .cse68 .cse42)) (* .cse68 12)) 0)) (.cse52 (not .cse29)) (.cse65 (- (* .cse68 18))) (.cse50 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse32 (+ 0 1)) (.cse61 (- (* 18 .cse43))) (.cse40 (+ .cse66 .cse63)) (.cse39 (+ .cse66 6))) (let ((.cse45 (or (= (+ (- 10) (+ (* .cse39 3) (+ (+ (+ (- (* .cse39 (* 3 .cse43))) (* (* 2 .cse40) .cse40)) .cse61) (- (* .cse40 10))))) 0) (not (= (+ (+ (- (* .cse39 .cse43)) (* .cse42 .cse43)) (* 12 .cse43)) 0)) (not (<= .cse54 |ULTIMATE.start_main_~a~0#1|)))) (.cse19 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse18 (+ 6 1)) (.cse24 (+ 6 6)) (.cse48 (<= |ULTIMATE.start_main_~n~0#1| .cse32)) (.cse14 (let ((.cse69 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse69 .cse50) (let ((.cse70 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse70 65536) (<= 0 .cse70) (not .cse69)))))) (.cse51 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse26 (* (- 1) 6)) (.cse35 (or (not .cse53) .cse52 (= (+ (+ (+ (+ (+ (- (* .cse66 (* 3 .cse68))) (* (* 2 .cse63) .cse63)) .cse65) (- (* .cse63 10))) (* .cse66 3)) (- 10)) 0))) (.cse2 (= (+ (+ (- (* .cse34 6)) (+ (* .cse34 .cse34) (- (* .cse17 12)))) 12) 0)) (.cse3 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse67 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse13 (let ((.cse62 (+ 6 (* .cse54 6)))) (let ((.cse64 (not (= .cse62 .cse66)))) (let ((.cse57 (or .cse64 (= (+ (+ (+ (- (* .cse63 12)) (+ .cse65 (* .cse62 .cse63))) (* .cse62 2)) (- 6)) 0))) (.cse58 (or (= 0 (+ (- 6) (let ((.cse59 (+ 6 (* 6 .cse41)))) (+ (* 2 .cse59) (let ((.cse60 (+ .cse62 .cse63))) (+ (+ (* .cse60 .cse59) .cse61) (- (* .cse60 12)))))))) .cse64))) (or (and .cse4 .cse20 .cse21 .cse22 .cse23 .cse10 .cse57 .cse30 .cse12 .cse31 .cse33 .cse58) (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse4 .cse20 .cse21 .cse22 .cse10 .cse57 .cse30 .cse12 .cse31 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse15 .cse33 (= (+ 6 .cse27) |ULTIMATE.start_main_~z~0#1|) .cse58)))))) (.cse44 (or (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse56 (+ (* .cse46 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0) (not .cse28))) (.cse16 (<= .cse0 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse1 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (<= 2 .cse0) (= |ULTIMATE.start_main_~x~0#1| (+ .cse1 8)) .cse2 .cse3 .cse4 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse5 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse5 65536) (<= 2 .cse5) (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse5)) .cse7)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse5) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse9 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse8 (+ 65536 .cse9))) (and (<= 0 .cse8) (<= 2 .cse9) (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse9)) .cse7)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse8 65536)))))) .cse10 .cse11 .cse12 .cse13 .cse14 (= (+ 7 (+ (- 6) 18)) .cse1) .cse15 .cse16)) (let ((.cse25 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse17 .cse18) .cse2 (<= 7 .cse19) .cse3 (<= 7 (+ |ULTIMATE.start_main_~y~0#1| (- 12))) .cse4 .cse20 .cse21 .cse22 (= |ULTIMATE.start_main_~x~0#1| (+ .cse17 1)) .cse23 .cse10 (= .cse24 .cse25) (= (+ (+ 7 .cse26) 0) (+ (* (- 1) 7) |ULTIMATE.start_main_~x~0#1|)) .cse11 (<= 1 .cse0) (= |ULTIMATE.start_main_~z~0#1| .cse27) (or .cse28 .cse29) .cse30 (= (+ 6 .cse25) |ULTIMATE.start_main_~z~0#1|) .cse12 .cse31 .cse14 (= .cse0 .cse32) .cse33 (= .cse24 .cse34) .cse16 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse34)) (= 0 (+ (- 1) .cse0)))) (and .cse35 .cse2 .cse3 .cse4 (<= 3 .cse0) .cse10 .cse11 (let ((.cse38 (+ .cse39 6)) (.cse37 (+ .cse40 .cse43))) (or (= (+ (+ (let ((.cse36 (+ .cse39 .cse40))) (+ (- (* .cse36 10)) (+ (- (* .cse37 18)) (+ (- (* .cse38 (* .cse37 3))) (* .cse36 (* .cse36 2)))))) (* .cse38 3)) (- 10)) 0) (not (<= .cse41 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse37 12) (+ (- (* .cse38 .cse37)) (* .cse37 .cse42))) 0)))) .cse12 .cse13 .cse44 .cse16 .cse45) (and .cse35 .cse2 .cse3 .cse4 .cse10 (<= 4 .cse0) .cse11 .cse12 .cse13 .cse44 .cse16 .cse45) (and (= (+ (+ (+ (- .cse46) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse42))) .cse47) (- 10)) 0) .cse28 .cse2 .cse3 .cse4 .cse21 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) (>= |ULTIMATE.start_main_~y~0#1| 1) .cse11 (= |ULTIMATE.start_main_~y~0#1| 1) .cse12 .cse48 .cse49 .cse14 .cse50 .cse51 (>= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 (= 6 |ULTIMATE.start_main_~z~0#1|)) (let ((.cse55 (+ .cse26 |ULTIMATE.start_main_~y~0#1|))) (and (<= 0 .cse19) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 .cse3 (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse32) (= |ULTIMATE.start_main_~n~0#1| .cse32) (= |ULTIMATE.start_main_~y~0#1| .cse18) .cse4 .cse20 .cse21 .cse22 .cse23 (= .cse24 |ULTIMATE.start_main_~z~0#1|) .cse10 (or .cse52 .cse53 (< .cse54 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse34 1)) .cse30 .cse12 .cse48 .cse31 (<= 1 (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|)) .cse14 (= .cse55 1) (<= 0 .cse0) .cse50 .cse51 (= .cse34 6) .cse16 (= (+ .cse55 0) |ULTIMATE.start_main_~x~0#1|))) (and .cse35 (<= 5 .cse0) .cse2 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 .cse44 .cse16)))))) [2023-02-18 01:21:52,538 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse52 (* 6 |ULTIMATE.start_main_~a~0#1|)) (.cse7 (- (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|))) (.cse11 (= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))) (.cse68 (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse63 (+ |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) (let ((.cse53 (+ .cse68 .cse63)) (.cse66 (+ 6 |ULTIMATE.start_main_~z~0#1|)) (.cse67 (* |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~z~0#1|)) (.cse27 (+ |ULTIMATE.start_main_~n~0#1| 1)) (.cse28 (+ |ULTIMATE.start_main_~z~0#1| (- 6))) (.cse56 (= |ULTIMATE.start_main_~n~0#1| 0)) (.cse71 (- (* |ULTIMATE.start_main_~y~0#1| 12))) (.cse55 (* 2 |ULTIMATE.start_main_~z~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~a~0#1| 5)) (.cse12 (>= |ULTIMATE.start_main_~a~0#1| 0)) (.cse73 (not .cse11)) (.cse41 (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| .cse52) .cse7)) 0)) (.cse42 (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (.cse76 (- (* |ULTIMATE.start_main_~x~0#1| 18))) (.cse54 (* 2 |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (.cse45 (= (+ (+ (+ (- (* |ULTIMATE.start_main_~y~0#1| 10)) (+ .cse76 (+ (* .cse54 |ULTIMATE.start_main_~y~0#1|) (- (* (* 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~z~0#1|))))) (* 3 |ULTIMATE.start_main_~z~0#1|)) (- 10)) 0)) (.cse23 (or .cse73 .cse41 .cse42)) (.cse4 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse10 .cse12) (and (or (not .cse10) (not .cse12)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse20 (= (+ (- 6) (+ (+ .cse71 (+ .cse76 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|))) .cse55)) 0)) (.cse21 (or .cse11 (let ((.cse75 (* |ULTIMATE.start_main_~n~0#1| (- 6)))) (let ((.cse74 (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 6)) 0))) (and .cse73 (or (<= |ULTIMATE.start_main_~z~0#1| 6) .cse74) (or (not .cse74) (not (<= (+ .cse75 |ULTIMATE.start_main_~z~0#1| (- 5)) 0)) (<= 0 .cse28)) .cse56))))) (.cse22 (= (+ (let ((.cse72 (* 3 |ULTIMATE.start_main_~n~0#1|))) (+ .cse72 (* .cse72 |ULTIMATE.start_main_~n~0#1|))) 1) |ULTIMATE.start_main_~y~0#1|)) (.cse29 (= .cse68 (* .cse27 (* .cse27 .cse27)))) (.cse43 (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~n~0#1| (* |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~n~0#1|)))) (.cse15 (<= 2 |ULTIMATE.start_main_~a~0#1|)) (.cse44 (= (+ 12 (+ (- (* 6 |ULTIMATE.start_main_~z~0#1|)) (+ .cse71 .cse67))) 0)) (.cse40 (+ 6 12)) (.cse51 (+ .cse27 1)) (.cse38 (+ (* (- 1) .cse28) |ULTIMATE.start_main_~y~0#1|)) (.cse26 (= (+ (+ (- (* .cse66 .cse68)) (* .cse68 .cse52)) (* .cse68 12)) 0)) (.cse25 (not .cse42)) (.cse65 (- (* .cse68 18))) (.cse32 (<= 0 |ULTIMATE.start_main_~a~0#1|)) (.cse18 (+ 0 1)) (.cse61 (- (* 18 .cse53))) (.cse50 (+ .cse66 .cse63)) (.cse49 (+ .cse66 6))) (let ((.cse19 (+ 6 1)) (.cse17 (+ (- 1) |ULTIMATE.start_main_~x~0#1|)) (.cse34 (* (- 1) 6)) (.cse24 (+ 6 6)) (.cse37 (or (= (+ (- 10) (+ (* .cse49 3) (+ (+ (+ (- (* .cse49 (* 3 .cse53))) (* (* 2 .cse50) .cse50)) .cse61) (- (* .cse50 10))))) 0) (not (= (+ (+ (- (* .cse49 .cse53)) (* .cse52 .cse53)) (* 12 .cse53)) 0)) (not (<= .cse27 |ULTIMATE.start_main_~a~0#1|)))) (.cse30 (<= |ULTIMATE.start_main_~n~0#1| .cse18)) (.cse14 (let ((.cse69 (<= (mod |ULTIMATE.start_main_~a~0#1| 65536) 32767))) (or (and (< |ULTIMATE.start_main_~a~0#1| 65536) .cse69 .cse32) (let ((.cse70 (+ 65536 |ULTIMATE.start_main_~a~0#1|))) (and (< .cse70 65536) (<= 0 .cse70) (not .cse69)))))) (.cse33 (= |ULTIMATE.start_main_~z~0#1| (+ (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 6))) (.cse35 (or (not .cse26) .cse25 (= (+ (+ (+ (+ (+ (- (* .cse66 (* 3 .cse68))) (* (* 2 .cse63) .cse63)) .cse65) (- (* .cse63 10))) (* .cse66 3)) (- 10)) 0))) (.cse2 (= (+ (+ (- (* .cse28 6)) (+ (* .cse28 .cse28) (- (* .cse38 12)))) 12) 0)) (.cse3 (= 0 (mod (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1| 17) .cse67 (* |ULTIMATE.start_main_~z~0#1| 10)) 18))) (.cse13 (let ((.cse62 (+ 6 (* .cse27 6)))) (let ((.cse64 (not (= .cse62 .cse66)))) (let ((.cse57 (or .cse64 (= (+ (+ (+ (- (* .cse63 12)) (+ .cse65 (* .cse62 .cse63))) (* .cse62 2)) (- 6)) 0))) (.cse58 (or (= 0 (+ (- 6) (let ((.cse59 (+ 6 (* 6 .cse51)))) (+ (* 2 .cse59) (let ((.cse60 (+ .cse62 .cse63))) (+ (+ (* .cse60 .cse59) .cse61) (- (* .cse60 12)))))))) .cse64))) (or (and .cse4 .cse20 .cse21 .cse22 .cse23 .cse10 .cse57 .cse29 .cse12 .cse43 .cse44 .cse58) (and (<= 19 (+ |ULTIMATE.start_main_~x~0#1| (- 8))) .cse4 .cse20 .cse21 .cse22 .cse10 .cse57 .cse29 .cse12 .cse43 (= (+ 2 1) |ULTIMATE.start_main_~n~0#1|) .cse15 .cse44 (= (+ 6 .cse40) |ULTIMATE.start_main_~z~0#1|) .cse58)))))) (.cse36 (or .cse45 (not .cse41))) (.cse16 (<= .cse0 |ULTIMATE.start_main_~a~0#1|))) (or (let ((.cse1 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) 18)))) (and (= (+ 6 18) |ULTIMATE.start_main_~z~0#1|) (<= 2 .cse0) (= |ULTIMATE.start_main_~x~0#1| (+ .cse1 8)) .cse2 .cse3 .cse4 (or (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse5 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (and (< .cse5 65536) (<= 2 .cse5) (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse5)) .cse7)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (<= 0 .cse5) (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)))) (exists ((|aux_div_ULTIMATE.start_main_~a~0#1_40| Int) (|aux_mod_ULTIMATE.start_main_~a~0#1_40| Int)) (let ((.cse9 (+ |aux_mod_ULTIMATE.start_main_~a~0#1_40| (* 65536 |aux_div_ULTIMATE.start_main_~a~0#1_40|)))) (let ((.cse8 (+ 65536 .cse9))) (and (<= 0 .cse8) (<= 2 .cse9) (= (+ .cse6 (+ (* |ULTIMATE.start_main_~x~0#1| (* 6 .cse9)) .cse7)) 0) (< |aux_mod_ULTIMATE.start_main_~a~0#1_40| 65536) (<= 0 |aux_mod_ULTIMATE.start_main_~a~0#1_40|) (not (<= |aux_mod_ULTIMATE.start_main_~a~0#1_40| 32767)) (< .cse8 65536)))))) .cse10 .cse11 .cse12 .cse13 .cse14 (= (+ 7 (+ (- 6) 18)) .cse1) .cse15 .cse16)) (let ((.cse31 (+ .cse34 |ULTIMATE.start_main_~y~0#1|))) (and (<= 0 .cse17) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) 1)) 0) .cse2 .cse3 (= .cse0 0) (= |ULTIMATE.start_main_~x~0#1| .cse18) (= |ULTIMATE.start_main_~n~0#1| .cse18) (= |ULTIMATE.start_main_~y~0#1| .cse19) .cse4 .cse20 .cse21 .cse22 .cse23 (= .cse24 |ULTIMATE.start_main_~z~0#1|) .cse10 (or .cse25 .cse26 (< .cse27 (+ |ULTIMATE.start_main_~a~0#1| 1))) (= |ULTIMATE.start_main_~x~0#1| 1) .cse11 (= |ULTIMATE.start_main_~y~0#1| (+ .cse28 1)) .cse29 .cse12 .cse30 (<= 1 (+ (* (- 1) |ULTIMATE.start_main_~z~0#1|) 6 |ULTIMATE.start_main_~y~0#1|)) .cse14 (= .cse31 1) (<= 0 .cse0) .cse32 .cse33 (= .cse28 6) .cse16 (= (+ .cse31 0) |ULTIMATE.start_main_~x~0#1|))) (and .cse35 .cse2 .cse3 .cse4 .cse10 (<= 4 .cse0) .cse11 .cse12 .cse13 .cse36 .cse16 .cse37) (let ((.cse39 (+ (- 7) |ULTIMATE.start_main_~y~0#1|))) (and (= .cse38 .cse19) .cse2 (<= 7 .cse17) .cse3 (<= 7 (+ |ULTIMATE.start_main_~y~0#1| (- 12))) .cse4 .cse21 .cse22 (= |ULTIMATE.start_main_~x~0#1| (+ .cse38 1)) .cse23 .cse10 (= .cse24 .cse39) (= (+ (+ 7 .cse34) 0) (+ (* (- 1) 7) |ULTIMATE.start_main_~x~0#1|)) .cse11 (<= 1 .cse0) (= |ULTIMATE.start_main_~z~0#1| .cse40) (or .cse41 .cse42) .cse29 (= (+ 6 .cse39) |ULTIMATE.start_main_~z~0#1|) .cse12 .cse43 .cse14 (= .cse0 .cse18) .cse44 (= .cse24 .cse28) .cse16 (= |ULTIMATE.start_main_~y~0#1| (+ 7 .cse28)) (= 0 (+ (- 1) .cse0)))) (and .cse35 .cse2 .cse3 .cse4 (<= 3 .cse0) .cse45 .cse10 .cse11 (let ((.cse48 (+ .cse49 6)) (.cse47 (+ .cse50 .cse53))) (or (= (+ (+ (let ((.cse46 (+ .cse49 .cse50))) (+ (- (* .cse46 10)) (+ (- (* .cse47 18)) (+ (- (* .cse48 (* .cse47 3))) (* .cse46 (* .cse46 2)))))) (* .cse48 3)) (- 10)) 0) (not (<= .cse51 |ULTIMATE.start_main_~a~0#1|)) (not (= (+ (* .cse47 12) (+ (- (* .cse48 .cse47)) (* .cse47 .cse52))) 0)))) .cse12 .cse13 .cse14 .cse16 .cse37) (and (= (+ (+ (+ (- .cse54) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (- .cse52))) .cse55) (- 10)) 0) .cse41 .cse2 .cse3 .cse4 .cse21 .cse10 (>= |ULTIMATE.start_main_~n~0#1| 0) (>= |ULTIMATE.start_main_~y~0#1| 1) .cse11 (= |ULTIMATE.start_main_~y~0#1| 1) .cse12 .cse30 .cse56 .cse14 .cse32 .cse33 (>= |ULTIMATE.start_main_~x~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0) .cse16 (= 6 |ULTIMATE.start_main_~z~0#1|)) (and .cse35 (<= 5 .cse0) .cse2 .cse3 .cse4 .cse10 .cse11 .cse12 .cse13 .cse36 .cse16)))))) [2023-02-18 01:21:52,538 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-02-18 01:21:52,538 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-02-18 01:21:52,538 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-02-18 01:21:52,538 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-02-18 01:21:52,538 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: (let ((.cse1 (= |__VERIFIER_assert_#in~cond| 0))) (let ((.cse0 (not .cse1)) (.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (or .cse0 (and .cse1 (or (not .cse2) .cse1)) (and .cse0 .cse2)))) [2023-02-18 01:21:52,539 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-18 01:21:52,541 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 01:21:52,542 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 01:21:52,563 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:21:52 BoogieIcfgContainer [2023-02-18 01:21:52,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 01:21:52,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 01:21:52,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 01:21:52,610 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 01:21:52,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:20:43" (3/4) ... [2023-02-18 01:21:52,613 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 01:21:52,617 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 01:21:52,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-18 01:21:52,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 01:21:52,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 01:21:52,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 01:21:52,635 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((-1 * (z + -6) + y == 6 + 1 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 7 <= -1 + x) && 0 == (y * z * 17 + z * z + z * 10) % 18) && 7 <= y + -12) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && x == -1 * (z + -6) + y + 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && a <= 5) && 6 + 6 == -7 + y) && 7 + -1 * 6 + 0 == -1 * 7 + x) && 1 <= -1 + n) && z == 6 + 12) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && 6 + (-7 + y) == z) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 + n == 0 + 1) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + 6 == z + -6) && -1 + n <= a) && y == 7 + (z + -6)) && 0 == -1 + (-1 + n)) || (((((((((((((((((((((((((((((0 <= -1 + x && x + -1 * 1 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && -1 + n == 0) && x == 0 + 1) && n == 0 + 1) && y == 6 + 1) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && 6 + 6 == z) && a <= 5) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && z == 6 + 6 * n) && y == z + -6 + 1) && x + y == (n + 1) * ((n + 1) * (n + 1))) && a >= 0) && n <= 0 + 1) && 1 <= -1 * z + 6 + y) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 * 6 + y == 1) && 0 <= -1 + n) && 0 <= a) && z == -1 + y + 6) && z + -6 == 6) && -1 + n <= a) && -1 * 6 + y + 0 == x)) || ((((((((((((((6 + 18 == z && 2 <= -1 + n) && x == y + -1 * 18 + 8) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && ((\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40 < 65536 && 2 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767) || (\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((0 <= 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && 2 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && !(aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767)) && 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) < 65536))) && a <= 5) && a >= 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 7 + (-6 + 18) == y + -1 * 18) && 2 <= a) && -1 + n <= a)) || ((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && 5 <= -1 + n) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && a <= 5) && a >= 0) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && -1 + n <= a)) || (((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && a <= 5) && 4 <= -1 + n) && a >= 0) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a)))) || (((((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && 3 <= -1 + n) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && a <= 5) && ((-((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0 || !(n + 1 + 1 <= a)) || !((6 + z + (y + z) + (x + y + (y + z))) * 12 + (-((6 + z + 6 + 6) * (6 + z + (y + z) + (x + y + (y + z)))) + (6 + z + (y + z) + (x + y + (y + z))) * (6 * a)) == 0))) && a >= 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a)))) || ((((((((((((((((((((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 && x * 12 + (x * (6 * a) + -(x * z)) == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0))) && a <= 5) && n >= 0) && y >= 1) && z == 6 + 6 * n) && y == 1) && a >= 0) && n <= 0 + 1) && n == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 0 <= a) && z == -1 + y + 6) && x >= 0) && x == 0) && -1 + n <= a) && 6 == z) [2023-02-18 01:21:52,643 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 01:21:52,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 01:21:52,644 INFO L158 Benchmark]: Toolchain (without parser) took 69600.06ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 75.6MB in the beginning and 80.4MB in the end (delta: -4.9MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,645 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 01:21:52,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.55ms. Allocated memory is still 107.0MB. Free memory was 75.3MB in the beginning and 64.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.08ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 62.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,645 INFO L158 Benchmark]: Boogie Preprocessor took 16.39ms. Allocated memory is still 107.0MB. Free memory was 62.8MB in the beginning and 61.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,646 INFO L158 Benchmark]: RCFGBuilder took 181.47ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 51.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,646 INFO L158 Benchmark]: TraceAbstraction took 69187.70ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 50.9MB in the beginning and 83.6MB in the end (delta: -32.7MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,646 INFO L158 Benchmark]: Witness Printer took 32.70ms. Allocated memory is still 136.3MB. Free memory was 83.6MB in the beginning and 80.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 01:21:52,651 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 107.0MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.55ms. Allocated memory is still 107.0MB. Free memory was 75.3MB in the beginning and 64.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.08ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 62.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.39ms. Allocated memory is still 107.0MB. Free memory was 62.8MB in the beginning and 61.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 181.47ms. Allocated memory is still 107.0MB. Free memory was 61.7MB in the beginning and 51.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 69187.70ms. Allocated memory was 107.0MB in the beginning and 136.3MB in the end (delta: 29.4MB). Free memory was 50.9MB in the beginning and 83.6MB in the end (delta: -32.7MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 32.70ms. Allocated memory is still 136.3MB. Free memory was 83.6MB in the beginning and 80.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] * 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.1s, OverallIterations: 15, TraceHistogramMax: 49, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 46.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 42.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 1256 SdHoareTripleChecker+Invalid, 42.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 794 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4382 IncrementalHoareTripleChecker+Invalid, 5042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 462 mSDtfsCounter, 4382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1935 GetRequests, 1693 SyntacticMatches, 12 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=14, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 98 PreInvPairs, 166 NumberOfFragments, 50560 HoareAnnotationTreeSize, 98 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 1137 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1794 ConstructedInterpolants, 2 QuantifiedInterpolants, 14058 SizeOfPredicates, 69 NumberOfNonLiveVariables, 2400 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 13029/13626 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant [2023-02-18 01:21:52,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,668 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] [2023-02-18 01:21:52,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_ULTIMATE.start_main_~a~0#1_40,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((-1 * (z + -6) + y == 6 + 1 && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 7 <= -1 + x) && 0 == (y * z * 17 + z * z + z * 10) % 18) && 7 <= y + -12) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && x == -1 * (z + -6) + y + 1) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && a <= 5) && 6 + 6 == -7 + y) && 7 + -1 * 6 + 0 == -1 * 7 + x) && 1 <= -1 + n) && z == 6 + 12) && (x * 12 + (x * (6 * a) + -(x * z)) == 0 || n <= a)) && 6 + (-7 + y) == z) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (!(z == 6 + 6 * n) || x + y == (n + 1) * ((n + 1) * (n + 1)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 + n == 0 + 1) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && 6 + 6 == z + -6) && -1 + n <= a) && y == 7 + (z + -6)) && 0 == -1 + (-1 + n)) || (((((((((((((((((((((((((((((0 <= -1 + x && x + -1 * 1 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && -1 + n == 0) && x == 0 + 1) && n == 0 + 1) && y == 6 + 1) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) && 6 + 6 == z) && a <= 5) && ((!(n <= a) || -((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || n + 1 < a + 1)) && x == 1) && z == 6 + 6 * n) && y == z + -6 + 1) && x + y == (n + 1) * ((n + 1) * (n + 1))) && a >= 0) && n <= 0 + 1) && 1 <= -1 * z + 6 + y) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 * 6 + y == 1) && 0 <= -1 + n) && 0 <= a) && z == -1 + y + 6) && z + -6 == 6) && -1 + n <= a) && -1 * 6 + y + 0 == x)) || ((((((((((((((6 + 18 == z && 2 <= -1 + n) && x == y + -1 * 18 + 8) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && ((\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40 < 65536 && 2 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767) || (\exists aux_div_ULTIMATE.start_main_~a~0#1_40 : int, aux_mod_ULTIMATE.start_main_~a~0#1_40 : int :: (((((0 <= 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && 2 <= aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) && x * 12 + (x * (6 * (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40)) + -(x * z)) == 0) && aux_mod_ULTIMATE.start_main_~a~0#1_40 < 65536) && 0 <= aux_mod_ULTIMATE.start_main_~a~0#1_40) && !(aux_mod_ULTIMATE.start_main_~a~0#1_40 <= 32767)) && 65536 + (aux_mod_ULTIMATE.start_main_~a~0#1_40 + 65536 * aux_div_ULTIMATE.start_main_~a~0#1_40) < 65536))) && a <= 5) && a >= 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 7 + (-6 + 18) == y + -1 * 18) && 2 <= a) && -1 + n <= a)) || ((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && 5 <= -1 + n) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && a <= 5) && a >= 0) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && -1 + n <= a)) || (((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && a <= 5) && 4 <= -1 + n) && a >= 0) && (-(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0 || !(x * 12 + (x * (6 * a) + -(x * z)) == 0))) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a)))) || (((((((((((((((!(-((6 + z) * (x + y)) + (x + y) * (6 * a) + (x + y) * 12 == 0) || !(n <= a)) || -((6 + z) * (3 * (x + y))) + 2 * (y + z) * (y + z) + -((x + y) * 18) + -((y + z) * 10) + (6 + z) * 3 + -10 == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && ((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && ((!(z == 6 + 6 * n) || x * 12 + (x * (6 * a) + -(x * z)) == 0) || n <= a)) || ((((((((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) || (((((((((((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0)) && a <= 5) && (!(6 + (n + 1) * 6 == 6 + z) || -((y + z) * 12) + (-((x + y) * 18) + (6 + (n + 1) * 6) * (y + z)) + (6 + (n + 1) * 6) * 2 + -6 == 0)) && a >= 0) && x == n * (n * n)) && (((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && 3 * n + 3 * n * n + 1 == y) || ((z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0)) && (!(z == 6 + 6 * n) || 3 * n + 3 * n * n + 1 == y)))) && 12 + (-(6 * z) + (-(y * 12) + z * z)) == 0) && (0 == -6 + (2 * (6 + 6 * (n + 1 + 1)) + ((6 + (n + 1) * 6 + (y + z)) * (6 + 6 * (n + 1 + 1)) + -(18 * (x + y + (y + z))) + -((6 + (n + 1) * 6 + (y + z)) * 12))) || !(6 + (n + 1) * 6 == 6 + z))) && (!(z == 6 + 6 * n) || -6 + (-(y * 12) + (-(x * 18) + y * z) + 2 * z) == 0))) && 19 <= x + -8) && 2 + 1 == n) && 2 <= a) && 6 + (6 + 12) == z))) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && 3 <= -1 + n) && (-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 || n <= a)) && -(y * 10) + (-(x * 18) + (2 * y * y + -(3 * x * z))) + 3 * z + -10 == 0) && a <= 5) && ((-((6 + z + 6 + (6 + z + (y + z))) * 10) + (-((6 + z + (y + z) + (x + y + (y + z))) * 18) + (-((6 + z + 6 + 6) * ((6 + z + (y + z) + (x + y + (y + z))) * 3)) + (6 + z + 6 + (6 + z + (y + z))) * ((6 + z + 6 + (6 + z + (y + z))) * 2))) + (6 + z + 6 + 6) * 3 + -10 == 0 || !(n + 1 + 1 <= a)) || !((6 + z + (y + z) + (x + y + (y + z))) * 12 + (-((6 + z + 6 + 6) * (6 + z + (y + z) + (x + y + (y + z)))) + (6 + z + (y + z) + (x + y + (y + z))) * (6 * a)) == 0))) && a >= 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && -1 + n <= a) && ((-10 + ((6 + z + 6) * 3 + (-((6 + z + 6) * (3 * (x + y + (y + z)))) + 2 * (6 + z + (y + z)) * (6 + z + (y + z)) + -(18 * (x + y + (y + z))) + -((6 + z + (y + z)) * 10))) == 0 || !(-((6 + z + 6) * (x + y + (y + z))) + 6 * a * (x + y + (y + z)) + 12 * (x + y + (y + z)) == 0)) || !(n + 1 <= a)))) || ((((((((((((((((((((-(2 * y) + (a * z + -(6 * a)) + 2 * z + -10 == 0 && x * 12 + (x * (6 * a) + -(x * z)) == 0) && -((z + -6) * 6) + ((z + -6) * (z + -6) + -((-1 * (z + -6) + y) * 12)) + 12 == 0) && 0 == (y * z * 17 + z * z + z * 10) % 18) && (((cond == 1 && a <= 5) && a >= 0) || ((!(a <= 5) || !(a >= 0)) && cond == 0))) && (z == 6 + 6 * n || (((!(z == 6 + 6 * n) && (z <= 6 || n * -6 + z + -6 <= 0)) && ((!(n * -6 + z + -6 <= 0) || !(n * -6 + z + -5 <= 0)) || 0 <= z + -6)) && n == 0))) && a <= 5) && n >= 0) && y >= 1) && z == 6 + 6 * n) && y == 1) && a >= 0) && n <= 0 + 1) && n == 0) && (((a < 65536 && a % 65536 <= 32767) && 0 <= a) || ((65536 + a < 65536 && 0 <= 65536 + a) && !(a % 65536 <= 32767)))) && 0 <= a) && z == -1 + y + 6) && x >= 0) && x == 0) && -1 + n <= a) && 6 == z) RESULT: Ultimate proved your program to be correct! [2023-02-18 01:21:52,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE