./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.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/prod4br-ll_valuebound20.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 d6a7b66d62d8261743d542694624b328b551f76289ee08b3039b7ca01c3c317e --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:23:25,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:23:25,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:23:25,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:23:25,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:23:25,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:23:25,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:23:25,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:23:25,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:23:25,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:23:25,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:23:25,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:23:25,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:23:25,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:23:25,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:23:25,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:23:25,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:23:25,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:23:25,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:23:25,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:23:25,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:23:25,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:23:25,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:23:25,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:23:25,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:23:25,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:23:25,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:23:25,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:23:25,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:23:25,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:23:25,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:23:25,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:23:25,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:23:25,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:23:25,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:23:25,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:23:25,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:23:25,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:23:25,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:23:25,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:23:25,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:23:25,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:23:25,649 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:23:25,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:23:25,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:23:25,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:23:25,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:23:25,651 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:23:25,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:23:25,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:23:25,651 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:23:25,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:23:25,652 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:23:25,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:23:25,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:23:25,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:23:25,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:23:25,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:23:25,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:23:25,653 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:23:25,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:23:25,653 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:23:25,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:23:25,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:23:25,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:23:25,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:23:25,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:23:25,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:23:25,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:23:25,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:23:25,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:23:25,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:23:25,655 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:23:25,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:23:25,655 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:23:25,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:23:25,656 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:23:25,656 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 -> d6a7b66d62d8261743d542694624b328b551f76289ee08b3039b7ca01c3c317e [2023-02-17 02:23:25,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:23:25,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:23:25,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:23:25,855 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:23:25,855 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:23:25,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.c [2023-02-17 02:23:26,859 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:23:27,012 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:23:27,012 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound20.c [2023-02-17 02:23:27,016 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2f50305/9ea732b4150f43608f65c520e3a581ad/FLAG6d32e1c83 [2023-02-17 02:23:27,026 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2f50305/9ea732b4150f43608f65c520e3a581ad [2023-02-17 02:23:27,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:23:27,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:23:27,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:23:27,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:23:27,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:23:27,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e3156f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27, skipping insertion in model container [2023-02-17 02:23:27,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:23:27,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:23:27,137 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/prod4br-ll_valuebound20.c[524,537] [2023-02-17 02:23:27,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:23:27,159 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:23:27,167 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/prod4br-ll_valuebound20.c[524,537] [2023-02-17 02:23:27,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:23:27,180 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:23:27,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27 WrapperNode [2023-02-17 02:23:27,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:23:27,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:23:27,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:23:27,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:23:27,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,202 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-17 02:23:27,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:23:27,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:23:27,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:23:27,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:23:27,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,215 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:23:27,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:23:27,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:23:27,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:23:27,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (1/1) ... [2023-02-17 02:23:27,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:23:27,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:27,241 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-17 02:23:27,255 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-17 02:23:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:23:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 02:23:27,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 02:23:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:23:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:23:27,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:23:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:23:27,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:23:27,322 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:23:27,323 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:23:27,484 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:23:27,489 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:23:27,490 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 02:23:27,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:23:27 BoogieIcfgContainer [2023-02-17 02:23:27,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:23:27,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:23:27,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:23:27,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:23:27,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:23:27" (1/3) ... [2023-02-17 02:23:27,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b56307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:23:27, skipping insertion in model container [2023-02-17 02:23:27,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:23:27" (2/3) ... [2023-02-17 02:23:27,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b56307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:23:27, skipping insertion in model container [2023-02-17 02:23:27,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:23:27" (3/3) ... [2023-02-17 02:23:27,514 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound20.c [2023-02-17 02:23:27,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:23:27,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:23:27,604 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:23:27,611 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;@46325358, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:23:27,613 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:23:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:23:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 02:23:27,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:23:27,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:23:27,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:23:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:23:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1472905330, now seen corresponding path program 1 times [2023-02-17 02:23:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:23:27,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883135476] [2023-02-17 02:23:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:23:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:23:27,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883135476] [2023-02-17 02:23:27,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 02:23:27,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505049808] [2023-02-17 02:23:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:27,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:27,765 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-17 02:23:27,766 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-17 02:23:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:27,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:23:27,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:23:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:23:27,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:23:27,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505049808] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:23:27,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:23:27,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:23:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140265054] [2023-02-17 02:23:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:23:27,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:23:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:23:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:23:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:23:27,866 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 02:23:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:23:27,880 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2023-02-17 02:23:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:23:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-17 02:23:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:23:27,886 INFO L225 Difference]: With dead ends: 55 [2023-02-17 02:23:27,886 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 02:23:27,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-17 02:23:27,890 INFO L413 NwaCegarLoop]: 36 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, 36 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-17 02:23:27,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:23:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 02:23:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-17 02:23:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-17 02:23:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-17 02:23:27,911 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 24 [2023-02-17 02:23:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:23:27,912 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-17 02:23:27,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 02:23:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-17 02:23:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 02:23:27,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:23:27,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:23:27,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:23:28,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-17 02:23:28,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:23:28,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:23:28,121 INFO L85 PathProgramCache]: Analyzing trace with hash 324198000, now seen corresponding path program 1 times [2023-02-17 02:23:28,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:23:28,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253645542] [2023-02-17 02:23:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:23:28,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:23:28,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918510890] [2023-02-17 02:23:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:28,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:28,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:28,140 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-17 02:23:28,142 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-17 02:23:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:28,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:23:28,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:23:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:23:28,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:23:28,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:23:28,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253645542] [2023-02-17 02:23:28,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:23:28,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918510890] [2023-02-17 02:23:28,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918510890] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:23:28,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:23:28,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 02:23:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528889624] [2023-02-17 02:23:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:23:28,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 02:23:28,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:23:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 02:23:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-17 02:23:28,235 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 02:23:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:23:28,361 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2023-02-17 02:23:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 02:23:28,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-17 02:23:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:23:28,363 INFO L225 Difference]: With dead ends: 39 [2023-02-17 02:23:28,363 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 02:23:28,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-17 02:23:28,364 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:23:28,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 76 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:23:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 02:23:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-02-17 02:23:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 02:23:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-17 02:23:28,375 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2023-02-17 02:23:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:23:28,376 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-17 02:23:28,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 02:23:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-02-17 02:23:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 02:23:28,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:23:28,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:23:28,385 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-17 02:23:28,582 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,SelfDestructingSolverStorable1 [2023-02-17 02:23:28,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:23:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:23:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 693549193, now seen corresponding path program 1 times [2023-02-17 02:23:28,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:23:28,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906627052] [2023-02-17 02:23:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:23:28,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:23:28,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456894571] [2023-02-17 02:23:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:28,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:28,594 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-17 02:23:28,596 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-17 02:23:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:28,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:23:28,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:23:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:23:28,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:23:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 02:23:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:23:28,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906627052] [2023-02-17 02:23:28,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:23:28,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456894571] [2023-02-17 02:23:28,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456894571] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:23:28,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:23:28,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-02-17 02:23:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79045866] [2023-02-17 02:23:28,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:23:28,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 02:23:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:23:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 02:23:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-17 02:23:28,929 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-17 02:23:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:23:29,140 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2023-02-17 02:23:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 02:23:29,141 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2023-02-17 02:23:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:23:29,144 INFO L225 Difference]: With dead ends: 47 [2023-02-17 02:23:29,145 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 02:23:29,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-02-17 02:23:29,148 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:23:29,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 91 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:23:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 02:23:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2023-02-17 02:23:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:23:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-02-17 02:23:29,166 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 30 [2023-02-17 02:23:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:23:29,167 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-02-17 02:23:29,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-17 02:23:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2023-02-17 02:23:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 02:23:29,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:23:29,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:23:29,176 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-17 02:23:29,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:29,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:23:29,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:23:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1087866724, now seen corresponding path program 1 times [2023-02-17 02:23:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:23:29,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736382524] [2023-02-17 02:23:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:23:29,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:23:29,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317260910] [2023-02-17 02:23:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:29,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:29,402 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-17 02:23:29,404 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-17 02:23:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:29,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-17 02:23:29,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:23:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:23:30,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:23:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:23:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:23:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736382524] [2023-02-17 02:23:44,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:23:44,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317260910] [2023-02-17 02:23:44,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317260910] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:23:44,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:23:44,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2023-02-17 02:23:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871005000] [2023-02-17 02:23:44,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:23:44,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 02:23:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:23:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 02:23:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2023-02-17 02:23:44,152 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 02:23:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:23:45,561 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2023-02-17 02:23:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:23:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2023-02-17 02:23:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:23:45,565 INFO L225 Difference]: With dead ends: 64 [2023-02-17 02:23:45,566 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 02:23:45,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2023-02-17 02:23:45,567 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 125 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-17 02:23:45,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 85 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-17 02:23:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 02:23:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2023-02-17 02:23:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-17 02:23:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-02-17 02:23:45,593 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 32 [2023-02-17 02:23:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:23:45,593 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-02-17 02:23:45,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 02:23:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2023-02-17 02:23:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 02:23:45,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:23:45,595 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:23:45,611 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-17 02:23:45,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:45,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:23:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:23:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash 420635516, now seen corresponding path program 1 times [2023-02-17 02:23:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:23:45,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028106792] [2023-02-17 02:23:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:23:45,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:23:45,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176166440] [2023-02-17 02:23:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:45,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:45,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:45,817 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-17 02:23:45,819 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-17 02:23:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:45,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 02:23:45,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:23:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 02:23:45,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:23:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:23:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:23:45,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028106792] [2023-02-17 02:23:45,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:23:45,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176166440] [2023-02-17 02:23:45,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176166440] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:23:45,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:23:45,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2023-02-17 02:23:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187562316] [2023-02-17 02:23:45,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:23:45,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:23:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:23:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:23:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-17 02:23:45,956 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-02-17 02:23:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:23:46,033 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2023-02-17 02:23:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:23:46,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 43 [2023-02-17 02:23:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:23:46,035 INFO L225 Difference]: With dead ends: 55 [2023-02-17 02:23:46,035 INFO L226 Difference]: Without dead ends: 45 [2023-02-17 02:23:46,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:23:46,036 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:23:46,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 83 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:23:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-17 02:23:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-17 02:23:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:23:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-02-17 02:23:46,045 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 43 [2023-02-17 02:23:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:23:46,045 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-17 02:23:46,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2023-02-17 02:23:46,046 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-02-17 02:23:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 02:23:46,047 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:23:46,047 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:23:46,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-17 02:23:46,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:46,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:23:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:23:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash 97606081, now seen corresponding path program 1 times [2023-02-17 02:23:46,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:23:46,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292946870] [2023-02-17 02:23:46,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:46,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:23:46,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 02:23:46,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108560720] [2023-02-17 02:23:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:23:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:23:46,261 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-17 02:23:46,262 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-17 02:23:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:23:46,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 02:23:46,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:23:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:23:46,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:23:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 02:23:46,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:23:46,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292946870] [2023-02-17 02:23:46,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 02:23:46,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108560720] [2023-02-17 02:23:46,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108560720] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 02:23:46,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:23:46,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-02-17 02:23:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755828511] [2023-02-17 02:23:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:23:46,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:23:46,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:23:46,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:23:46,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-17 02:23:46,359 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:23:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:23:46,499 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2023-02-17 02:23:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:23:46,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-02-17 02:23:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:23:46,499 INFO L225 Difference]: With dead ends: 45 [2023-02-17 02:23:46,499 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:23:46,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-17 02:23:46,500 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:23:46,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:23:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:23:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:23:46,502 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-17 02:23:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:23:46,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2023-02-17 02:23:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:23:46,502 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:23:46,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:23:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:23:46,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:23:46,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:23:46,510 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-17 02:23:46,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:23:46,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:23:46,722 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:23:46,722 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-02-17 02:23:46,723 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-02-17 02:23:46,723 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2023-02-17 02:23:46,723 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:23:46,723 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 19 60) the Hoare annotation is: true [2023-02-17 02:23:46,723 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2023-02-17 02:23:46,723 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse31 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse3 (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse31 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) .cse2)) (.cse4 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1)))) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))))))) (.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (or (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1))) .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4) (let ((.cse5 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse21 (<= |ULTIMATE.start_main_~x~0#1| 20))) (and (<= 0 |ULTIMATE.start_main_~a~0#1|) .cse5 (or (and (let ((.cse7 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse10 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse13 (= .cse10 0)) (.cse8 (= .cse7 0)) (.cse20 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse12 (not .cse19)) (.cse6 (not .cse20)) (.cse9 (and (not .cse8) .cse20)) (.cse11 (and (not .cse13) .cse19))) (or (and (or .cse6 (not (<= (+ (- 2) .cse7) 0)) .cse8) (or (not (<= .cse7 0)) .cse9)) (and (or (not (<= .cse10 0)) .cse11) (or .cse12 (not (<= (+ (- 2) .cse10) 0)) .cse13)) (let ((.cse17 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse14 (+ .cse17 1)) (.cse18 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse16 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse12 (let ((.cse15 (+ 1 .cse18))) (and (or .cse6 (= (+ (* (* .cse14 .cse15) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse8) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse16 (* .cse17 .cse15))) .cse1) .cse9))) .cse13) (or (and (or .cse6 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse14 .cse18) .cse16)) .cse1) .cse8) (or (= (+ (* (* .cse17 .cse18) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse9)) .cse11)))))))) .cse2 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse3 .cse5 .cse21 .cse4) (let ((.cse30 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse32 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse33 (= .cse32 0)) (.cse24 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse29 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse34 (= .cse30 0))) (let ((.cse28 (not .cse34)) (.cse27 (or (not .cse29) .cse34)) (.cse22 (or .cse33 (not .cse24))) (.cse25 (not .cse33))) (and (let ((.cse23 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse22 (= |ULTIMATE.start_main_~b~0#1| .cse23)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse23)) .cse24 .cse25))) (let ((.cse26 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse26 |ULTIMATE.start_main_~a~0#1|) .cse27) (and .cse28 .cse29 (= (+ .cse26 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 (or (and .cse28 .cse29 (<= (+ .cse30 (- 2)) 0)) (and .cse27 (<= .cse30 0))) .cse31 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse3 .cse5 .cse21 .cse4 (or (and .cse22 (<= .cse32 0)) (and .cse24 (<= (+ (- 2) .cse32) 0) .cse25))))))) .cse21 (= .cse0 0)))))) [2023-02-17 02:23:46,724 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:23:46,724 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:23:46,724 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 20)) [2023-02-17 02:23:46,724 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (let ((.cse12 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse13 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse14 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse9 (= .cse13 0)) (.cse7 (= .cse12 0)) (.cse15 (< |ULTIMATE.start_main_~x~0#1| 0))) (let ((.cse6 (not .cse15)) (.cse0 (and (not .cse7) .cse15)) (.cse8 (and .cse14 (not .cse9))) (.cse10 (not .cse14))) (or (let ((.cse3 (div |ULTIMATE.start_main_~x~0#1| 2))) (let ((.cse5 (+ .cse3 1)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* 4 1)) (.cse4 (div |ULTIMATE.start_main_~y~0#1| 2))) (and (or (and (or .cse0 (= .cse1 (+ (* .cse2 (* .cse3 .cse4)) 0))) (or (= (+ (* (* .cse5 .cse4) .cse2) 0) .cse1) .cse6 .cse7)) .cse8) (or .cse9 .cse10 (let ((.cse11 (+ 1 .cse4))) (and (or .cse6 .cse7 (= .cse1 (+ (* (* .cse5 .cse11) .cse2) 0))) (or (= .cse1 (+ (* .cse2 (* .cse3 .cse11)) 0)) .cse0))))))) (and (or (not (<= (+ .cse12 (- 2)) 0)) .cse6 .cse7) (or .cse0 (not (<= .cse12 0)))) (and (or (not (<= .cse13 0)) .cse8) (or .cse9 .cse10 (not (<= (+ (- 2) .cse13) 0)))))))) (>= |ULTIMATE.start_main_~x~0#1| 0) (<= |ULTIMATE.start_main_~x~0#1| 20)) [2023-02-17 02:23:46,724 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse31 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse3 (or (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse31 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)) .cse2)) (.cse4 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1)))) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse1) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))))))) (.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (or (and (>= |ULTIMATE.start_main_~p~0#1| 1) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1))) .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse3 .cse4) (let ((.cse5 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse21 (<= |ULTIMATE.start_main_~x~0#1| 20))) (and (<= 0 |ULTIMATE.start_main_~a~0#1|) .cse5 (or (and (let ((.cse7 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse10 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse13 (= .cse10 0)) (.cse8 (= .cse7 0)) (.cse20 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse19 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse12 (not .cse19)) (.cse6 (not .cse20)) (.cse9 (and (not .cse8) .cse20)) (.cse11 (and (not .cse13) .cse19))) (or (and (or .cse6 (not (<= (+ (- 2) .cse7) 0)) .cse8) (or (not (<= .cse7 0)) .cse9)) (and (or (not (<= .cse10 0)) .cse11) (or .cse12 (not (<= (+ (- 2) .cse10) 0)) .cse13)) (let ((.cse17 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse14 (+ .cse17 1)) (.cse18 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse16 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse12 (let ((.cse15 (+ 1 .cse18))) (and (or .cse6 (= (+ (* (* .cse14 .cse15) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse8) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse16 (* .cse17 .cse15))) .cse1) .cse9))) .cse13) (or (and (or .cse6 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse14 .cse18) .cse16)) .cse1) .cse8) (or (= (+ (* (* .cse17 .cse18) .cse16) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse9)) .cse11)))))))) .cse2 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse0) |ULTIMATE.start_main_~q~0#1|) .cse1) .cse3 .cse5 .cse21 .cse4) (let ((.cse30 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse32 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse33 (= .cse32 0)) (.cse24 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse29 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse34 (= .cse30 0))) (let ((.cse28 (not .cse34)) (.cse27 (or (not .cse29) .cse34)) (.cse22 (or .cse33 (not .cse24))) (.cse25 (not .cse33))) (and (let ((.cse23 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse22 (= |ULTIMATE.start_main_~b~0#1| .cse23)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse23)) .cse24 .cse25))) (let ((.cse26 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse26 |ULTIMATE.start_main_~a~0#1|) .cse27) (and .cse28 .cse29 (= (+ .cse26 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 (or (and .cse28 .cse29 (<= (+ .cse30 (- 2)) 0)) (and .cse27 (<= .cse30 0))) .cse31 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse3 .cse5 .cse21 .cse4 (or (and .cse22 (<= .cse32 0)) (and .cse24 (<= (+ (- 2) .cse32) 0) .cse25))))))) .cse21 (= .cse0 0)))))) [2023-02-17 02:23:46,724 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2023-02-17 02:23:46,724 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse7 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse8 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse12 (let ((.cse28 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse31 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse34 (= .cse31 0)) (.cse29 (= .cse28 0)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse33 (not .cse40)) (.cse27 (not .cse41)) (.cse30 (and (not .cse29) .cse41)) (.cse32 (and (not .cse34) .cse40))) (or (and (or .cse27 (not (<= (+ (- 2) .cse28) 0)) .cse29) (or (not (<= .cse28 0)) .cse30)) (and (or (not (<= .cse31 0)) .cse32) (or .cse33 (not (<= (+ (- 2) .cse31) 0)) .cse34)) (let ((.cse38 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse35 (+ .cse38 1)) (.cse39 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse37 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse33 (let ((.cse36 (+ 1 .cse39))) (and (or .cse27 (= (+ (* (* .cse35 .cse36) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse8) .cse29) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse37 (* .cse38 .cse36))) .cse8) .cse30))) .cse34) (or (and (or .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse35 .cse39) .cse37)) .cse8) .cse29) (or (= (+ (* (* .cse38 .cse39) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse8) .cse30)) .cse32))))))))) (.cse11 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse13 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse7) |ULTIMATE.start_main_~q~0#1|) .cse8)) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~x~0#1| 20)) (.cse4 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse5 (not (= |ULTIMATE.start_main_~a~0#1| 0))) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (let ((.cse14 (or (and .cse9 (or (= |ULTIMATE.start_main_~q~0#1| .cse8) (and .cse4 .cse5))) .cse9))) (or (and .cse12 .cse9 .cse13 .cse2 .cse3 .cse14) (let ((.cse23 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse24 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse25 (= .cse24 0)) (.cse17 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse22 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse26 (= .cse23 0))) (let ((.cse21 (not .cse26)) (.cse20 (or (not .cse22) .cse26)) (.cse15 (or .cse25 (not .cse17))) (.cse18 (not .cse25))) (and (let ((.cse16 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse15 (= |ULTIMATE.start_main_~b~0#1| .cse16)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse16)) .cse17 .cse18))) (let ((.cse19 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse19 |ULTIMATE.start_main_~a~0#1|) .cse20) (and .cse21 .cse22 (= (+ .cse19 1) |ULTIMATE.start_main_~a~0#1|)))) .cse9 (or (and .cse21 .cse22 (<= (+ .cse23 (- 2)) 0)) (and .cse20 (<= .cse23 0))) .cse11 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse2 .cse3 .cse14 (or (and .cse15 (<= .cse24 0)) (and .cse17 (<= (+ (- 2) .cse24) 0) .cse18)))))) (and .cse9 .cse13 .cse2 .cse3 .cse14)))) (.cse6 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse7) |ULTIMATE.start_main_~q~0#1|) .cse8))) .cse9 .cse10 .cse11 .cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse2 .cse3) (and .cse6 .cse12 .cse9 .cse10 .cse13 .cse1 .cse2 .cse3))))) [2023-02-17 02:23:46,725 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse7 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse8 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse12 (let ((.cse28 (mod |ULTIMATE.start_main_~a~0#1| 2)) (.cse31 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse34 (= .cse31 0)) (.cse29 (= .cse28 0)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0))) (let ((.cse33 (not .cse40)) (.cse27 (not .cse41)) (.cse30 (and (not .cse29) .cse41)) (.cse32 (and (not .cse34) .cse40))) (or (and (or .cse27 (not (<= (+ (- 2) .cse28) 0)) .cse29) (or (not (<= .cse28 0)) .cse30)) (and (or (not (<= .cse31 0)) .cse32) (or .cse33 (not (<= (+ (- 2) .cse31) 0)) .cse34)) (let ((.cse38 (div |ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse35 (+ .cse38 1)) (.cse39 (div |ULTIMATE.start_main_~b~0#1| 2)) (.cse37 (* |ULTIMATE.start_main_~p~0#1| 4))) (and (or .cse33 (let ((.cse36 (+ 1 .cse39))) (and (or .cse27 (= (+ (* (* .cse35 .cse36) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse8) .cse29) (or (= (+ |ULTIMATE.start_main_~q~0#1| (* .cse37 (* .cse38 .cse36))) .cse8) .cse30))) .cse34) (or (and (or .cse27 (= (+ |ULTIMATE.start_main_~q~0#1| (* (* .cse35 .cse39) .cse37)) .cse8) .cse29) (or (= (+ (* (* .cse38 .cse39) .cse37) |ULTIMATE.start_main_~q~0#1|) .cse8) .cse30)) .cse32))))))))) (.cse11 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse13 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse7) |ULTIMATE.start_main_~q~0#1|) .cse8)) (.cse2 (>= |ULTIMATE.start_main_~x~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~x~0#1| 20)) (.cse4 (not (= |ULTIMATE.start_main_~b~0#1| 0))) (.cse5 (not (= |ULTIMATE.start_main_~a~0#1| 0))) (.cse9 (>= |ULTIMATE.start_main_~y~0#1| 1))) (let ((.cse0 (let ((.cse14 (or (and .cse9 (or (= |ULTIMATE.start_main_~q~0#1| .cse8) (and .cse4 .cse5))) .cse9))) (or (and .cse12 .cse9 .cse13 .cse2 .cse3 .cse14) (let ((.cse23 (mod |ULTIMATE.start_main_~x~0#1| 2)) (.cse24 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse25 (= .cse24 0)) (.cse17 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse22 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse26 (= .cse23 0))) (let ((.cse21 (not .cse26)) (.cse20 (or (not .cse22) .cse26)) (.cse15 (or .cse25 (not .cse17))) (.cse18 (not .cse25))) (and (let ((.cse16 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse15 (= |ULTIMATE.start_main_~b~0#1| .cse16)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse16)) .cse17 .cse18))) (let ((.cse19 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse19 |ULTIMATE.start_main_~a~0#1|) .cse20) (and .cse21 .cse22 (= (+ .cse19 1) |ULTIMATE.start_main_~a~0#1|)))) .cse9 (or (and .cse21 .cse22 (<= (+ .cse23 (- 2)) 0)) (and .cse20 (<= .cse23 0))) .cse11 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse2 .cse3 .cse14 (or (and .cse15 (<= .cse24 0)) (and .cse17 (<= (+ (- 2) .cse24) 0) .cse18)))))) (and .cse9 .cse13 .cse2 .cse3 .cse14)))) (.cse6 (>= |ULTIMATE.start_main_~p~0#1| 1)) (.cse10 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~a~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse2 .cse3) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse6 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (and (>= |ULTIMATE.start_main_~p~0#1| 1) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse7) |ULTIMATE.start_main_~q~0#1|) .cse8))) .cse9 .cse10 .cse11 .cse1 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) .cse2 .cse3) (and .cse6 .cse12 .cse9 .cse10 .cse13 .cse1 .cse2 .cse3))))) [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 8 10) the Hoare annotation is: true [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-17 02:23:46,725 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-17 02:23:46,726 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: (let ((.cse3 (< 0 2)) (.cse4 (= |__VERIFIER_assert_#in~cond| 1))) (let ((.cse5 (and .cse3 .cse4))) (or (let ((.cse0 (not .cse4)) (.cse2 (not .cse3))) (let ((.cse1 (or .cse0 .cse2))) (and (or (and .cse0 .cse1) .cse2) .cse0 .cse1))) .cse4 .cse5 (and .cse3 (or .cse4 .cse5))))) [2023-02-17 02:23:46,726 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-17 02:23:46,727 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-17 02:23:46,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:23:46,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,741 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,748 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,748 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:23:46 BoogieIcfgContainer [2023-02-17 02:23:46,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:23:46,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:23:46,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:23:46,757 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:23:46,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:23:27" (3/4) ... [2023-02-17 02:23:46,759 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:23:46,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-17 02:23:46,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 02:23:46,765 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-17 02:23:46,765 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 02:23:46,765 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 02:23:46,765 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:23:46,784 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) || ((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0))))) || ((((y >= 1 && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))) && 0 <= a) && x >= 0) && x <= 20) || (((((!(b == 0) && ((((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) || ((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0))))) || ((((y >= 1 && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)))) && !(a == 0)) && 0 <= a) && x >= 0) && x <= 20)) || ((((((((((p == 1 && b == y) && p >= 1) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 >= 1 && ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)) && y >= 1) && y <= b) && q == 0) && 0 <= a) && a == x) && x >= 0) && x <= 20)) || (((((((p >= 1 && (((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0))))) && y >= 1) && y <= b) && p * (a * b) + q == x * y) && 0 <= a) && x >= 0) && x <= 20) [2023-02-17 02:23:46,791 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:23:46,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:23:46,792 INFO L158 Benchmark]: Toolchain (without parser) took 19763.43ms. Allocated memory was 136.3MB in the beginning and 612.4MB in the end (delta: 476.1MB). Free memory was 90.8MB in the beginning and 462.1MB in the end (delta: -371.3MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2023-02-17 02:23:46,792 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:23:46,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.28ms. Allocated memory is still 136.3MB. Free memory was 90.2MB in the beginning and 79.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:23:46,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.89ms. Allocated memory is still 136.3MB. Free memory was 79.7MB in the beginning and 78.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:23:46,793 INFO L158 Benchmark]: Boogie Preprocessor took 12.86ms. Allocated memory is still 136.3MB. Free memory was 78.2MB in the beginning and 77.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:23:46,793 INFO L158 Benchmark]: RCFGBuilder took 275.42ms. Allocated memory is still 136.3MB. Free memory was 77.1MB in the beginning and 65.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:23:46,793 INFO L158 Benchmark]: TraceAbstraction took 19246.57ms. Allocated memory was 136.3MB in the beginning and 612.4MB in the end (delta: 476.1MB). Free memory was 64.5MB in the beginning and 464.2MB in the end (delta: -399.7MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2023-02-17 02:23:46,793 INFO L158 Benchmark]: Witness Printer took 35.15ms. Allocated memory is still 612.4MB. Free memory was 464.2MB in the beginning and 462.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:23:46,795 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.22ms. Allocated memory is still 102.8MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.28ms. Allocated memory is still 136.3MB. Free memory was 90.2MB in the beginning and 79.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.89ms. Allocated memory is still 136.3MB. Free memory was 79.7MB in the beginning and 78.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.86ms. Allocated memory is still 136.3MB. Free memory was 78.2MB in the beginning and 77.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.42ms. Allocated memory is still 136.3MB. Free memory was 77.1MB in the beginning and 65.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19246.57ms. Allocated memory was 136.3MB in the beginning and 612.4MB in the end (delta: 476.1MB). Free memory was 64.5MB in the beginning and 464.2MB in the end (delta: -399.7MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Witness Printer took 35.15ms. Allocated memory is still 612.4MB. Free memory was 464.2MB in the beginning and 462.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,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: 14]: 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 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 138 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 276 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 26 PreInvPairs, 41 NumberOfFragments, 4095 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 338 ConstructedInterpolants, 3 QuantifiedInterpolants, 4403 SizeOfPredicates, 31 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 181/216 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: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant [2023-02-17 02:23:46,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,807 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 02:23:46,811 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) || ((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0))))) || ((((y >= 1 && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1))) && 0 <= a) && x >= 0) && x <= 20) || (((((!(b == 0) && ((((((((((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0)))) && y >= 1) && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) || ((((((((((((y % 2 == 0 || !(y < 0)) && b == y / 2) || ((b == 1 + y / 2 && y < 0) && !(y % 2 == 0))) && ((x / 2 == a && (!(x < 0) || x % 2 == 0)) || ((!(x % 2 == 0) && x < 0) && x / 2 + 1 == a))) && y >= 1) && (((!(x % 2 == 0) && x < 0) && x % 2 + -2 <= 0) || ((!(x < 0) || x % 2 == 0) && x % 2 <= 0))) && q == 0) && 4 * 1 == p) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0))))) || ((((y >= 1 && p * (a * b) + q == x * y) && x >= 0) && x <= 20) && ((y >= 1 && (q == x * y || (!(b == 0) && !(a == 0)))) || y >= 1)))) && !(a == 0)) && 0 <= a) && x >= 0) && x <= 20)) || ((((((((((p == 1 && b == y) && p >= 1) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 >= 1 && ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)) && y >= 1) && y <= b) && q == 0) && 0 <= a) && a == x) && x >= 0) && x <= 20)) || (((((((p >= 1 && (((((!(a < 0) || !(-2 + a % 2 <= 0)) || a % 2 == 0) && (!(a % 2 <= 0) || (!(a % 2 == 0) && a < 0))) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || (((!(b < 0) || (((!(a < 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + q == x * y) || a % 2 == 0) && (q + p * 4 * (a / 2 * (1 + b / 2)) == x * y || (!(a % 2 == 0) && a < 0)))) || b % 2 == 0) && ((((!(a < 0) || q + (a / 2 + 1) * (b / 2) * (p * 4) == x * y) || a % 2 == 0) && (a / 2 * (b / 2) * (p * 4) + q == x * y || (!(a % 2 == 0) && a < 0))) || (!(b % 2 == 0) && b < 0))))) && y >= 1) && y <= b) && p * (a * b) + q == x * y) && 0 <= a) && x >= 0) && x <= 20) RESULT: Ultimate proved your program to be correct! [2023-02-17 02:23:46,831 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