./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/prod4br-ll.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/prod4br-ll.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 9fc373a278835802938e4c08f2544f1651ce1de6dc177c0a58501e43687c477d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:25:33,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:25:33,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:25:33,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:25:33,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:25:33,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:25:33,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:25:33,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:25:33,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:25:33,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:25:33,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:25:33,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:25:33,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:25:33,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:25:33,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:25:33,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:25:33,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:25:33,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:25:33,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:25:33,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:25:33,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:25:33,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:25:33,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:25:33,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:25:33,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:25:33,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:25:33,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:25:33,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:25:33,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:25:33,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:25:33,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:25:33,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:25:33,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:25:33,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:25:33,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:25:33,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:25:33,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:25:33,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:25:33,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:25:33,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:25:33,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:25:33,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:25:33,956 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:25:33,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:25:33,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:25:33,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:25:33,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:25:33,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:25:33,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:25:33,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:25:33,959 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:25:33,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:25:33,960 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:25:33,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:25:33,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:25:33,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:25:33,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:25:33,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:25:33,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:25:33,961 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:25:33,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:25:33,962 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:25:33,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:25:33,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:25:33,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:25:33,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:25:33,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:25:33,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:25:33,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:25:33,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:25:33,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:25:33,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:25:33,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:25:33,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:25:33,965 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:25:33,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:25:33,965 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:25:33,965 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 -> 9fc373a278835802938e4c08f2544f1651ce1de6dc177c0a58501e43687c477d [2023-02-17 01:25:34,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:25:34,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:25:34,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:25:34,195 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:25:34,196 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:25:34,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/prod4br-ll.c [2023-02-17 01:25:35,423 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:25:35,583 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:25:35,584 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/prod4br-ll.c [2023-02-17 01:25:35,588 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8d4e7d/feaddca650a64b599523742ab3d6d325/FLAG2ffc01651 [2023-02-17 01:25:35,598 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc8d4e7d/feaddca650a64b599523742ab3d6d325 [2023-02-17 01:25:35,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:25:35,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:25:35,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:25:35,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:25:35,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:25:35,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60851255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35, skipping insertion in model container [2023-02-17 01:25:35,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:25:35,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:25:35,737 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/prod4br-ll.c[524,537] [2023-02-17 01:25:35,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:25:35,759 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:25:35,768 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/prod4br-ll.c[524,537] [2023-02-17 01:25:35,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:25:35,786 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:25:35,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35 WrapperNode [2023-02-17 01:25:35,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:25:35,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:25:35,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:25:35,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:25:35,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,816 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-02-17 01:25:35,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:25:35,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:25:35,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:25:35,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:25:35,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,855 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:25:35,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:25:35,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:25:35,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:25:35,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (1/1) ... [2023-02-17 01:25:35,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:25:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:35,898 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 01:25:35,922 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 01:25:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:25:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:25:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:25:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:25:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:25:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:25:36,004 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:25:36,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:25:36,206 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:25:36,211 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:25:36,211 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:25:36,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:25:36 BoogieIcfgContainer [2023-02-17 01:25:36,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:25:36,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:25:36,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:25:36,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:25:36,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:25:35" (1/3) ... [2023-02-17 01:25:36,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6c3fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:25:36, skipping insertion in model container [2023-02-17 01:25:36,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:25:35" (2/3) ... [2023-02-17 01:25:36,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6c3fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:25:36, skipping insertion in model container [2023-02-17 01:25:36,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:25:36" (3/3) ... [2023-02-17 01:25:36,229 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2023-02-17 01:25:36,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:25:36,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:25:36,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:25:36,293 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;@400bf5e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:25:36,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:25:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:25:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 01:25:36,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:36,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:36,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash -588943746, now seen corresponding path program 1 times [2023-02-17 01:25:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081262089] [2023-02-17 01:25:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:36,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081262089] [2023-02-17 01:25:36,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 01:25:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185677473] [2023-02-17 01:25:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:36,417 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 01:25:36,418 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 01:25:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:36,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 01:25:36,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:25:36,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:25:36,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185677473] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:25:36,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:25:36,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:25:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864242918] [2023-02-17 01:25:36,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:25:36,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:25:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:25:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:25:36,567 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:25:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:36,587 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2023-02-17 01:25:36,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:25:36,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 01:25:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:36,595 INFO L225 Difference]: With dead ends: 41 [2023-02-17 01:25:36,596 INFO L226 Difference]: Without dead ends: 18 [2023-02-17 01:25:36,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 01:25:36,603 INFO L413 NwaCegarLoop]: 27 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, 27 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 01:25:36,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 01:25:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-17 01:25:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-17 01:25:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-02-17 01:25:36,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2023-02-17 01:25:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:36,651 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-02-17 01:25:36,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:25:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-02-17 01:25:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 01:25:36,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:36,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:36,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 01:25:36,857 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 01:25:36,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1187851076, now seen corresponding path program 1 times [2023-02-17 01:25:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:36,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591053927] [2023-02-17 01:25:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:36,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:25:36,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726309716] [2023-02-17 01:25:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:36,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:36,876 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 01:25:36,888 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 01:25:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:36,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 01:25:36,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:25:36,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:25:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:36,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591053927] [2023-02-17 01:25:36,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:25:36,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726309716] [2023-02-17 01:25:36,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726309716] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:25:36,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:25:36,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:25:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559002309] [2023-02-17 01:25:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:25:36,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:25:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:36,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:25:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:25:36,994 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:25:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:37,090 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-02-17 01:25:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 01:25:37,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 01:25:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:37,092 INFO L225 Difference]: With dead ends: 32 [2023-02-17 01:25:37,092 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 01:25:37,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 01:25:37,094 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:25:37,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:25:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 01:25:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2023-02-17 01:25:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:25:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-17 01:25:37,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 9 [2023-02-17 01:25:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:37,113 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-17 01:25:37,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 01:25:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-17 01:25:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 01:25:37,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:37,114 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:37,119 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 01:25:37,317 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 01:25:37,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1831703089, now seen corresponding path program 1 times [2023-02-17 01:25:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:37,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434135804] [2023-02-17 01:25:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:37,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:25:37,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262692723] [2023-02-17 01:25:37,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:37,331 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 01:25:37,342 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 01:25:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:37,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 01:25:37,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:25:37,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:25:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:25:37,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:37,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434135804] [2023-02-17 01:25:37,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:25:37,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262692723] [2023-02-17 01:25:37,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262692723] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:25:37,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:25:37,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2023-02-17 01:25:37,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778528427] [2023-02-17 01:25:37,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:25:37,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 01:25:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 01:25:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-17 01:25:37,734 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:38,067 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-02-17 01:25:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 01:25:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-02-17 01:25:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:38,071 INFO L225 Difference]: With dead ends: 40 [2023-02-17 01:25:38,071 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 01:25:38,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-02-17 01:25:38,074 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:25:38,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 55 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:25:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 01:25:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2023-02-17 01:25:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:25:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-17 01:25:38,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2023-02-17 01:25:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:38,098 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-17 01:25:38,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-17 01:25:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 01:25:38,099 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:38,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:38,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 01:25:38,305 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 01:25:38,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash 45117644, now seen corresponding path program 1 times [2023-02-17 01:25:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:38,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798617130] [2023-02-17 01:25:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:38,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:25:38,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887904954] [2023-02-17 01:25:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:38,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:38,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:38,322 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 01:25:38,340 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 01:25:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:38,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 01:25:38,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:25:38,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:25:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 01:25:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:40,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798617130] [2023-02-17 01:25:40,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:25:40,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887904954] [2023-02-17 01:25:40,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887904954] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:25:40,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:25:40,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-17 01:25:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863770788] [2023-02-17 01:25:40,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:25:40,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 01:25:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 01:25:40,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-02-17 01:25:40,660 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:43,753 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2023-02-17 01:25:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 01:25:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-17 01:25:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:43,755 INFO L225 Difference]: With dead ends: 54 [2023-02-17 01:25:43,755 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 01:25:43,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2023-02-17 01:25:43,756 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 125 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-17 01:25:43,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-17 01:25:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 01:25:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 24. [2023-02-17 01:25:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-17 01:25:43,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2023-02-17 01:25:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:43,776 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-17 01:25:43,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-17 01:25:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 01:25:43,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:43,777 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:43,789 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 01:25:43,989 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 01:25:43,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:43,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1388754562, now seen corresponding path program 1 times [2023-02-17 01:25:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:43,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614125050] [2023-02-17 01:25:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:44,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:25:44,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209992275] [2023-02-17 01:25:44,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:44,008 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 01:25:44,010 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 01:25:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:44,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 01:25:44,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:25:44,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:25:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:44,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614125050] [2023-02-17 01:25:44,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:25:44,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209992275] [2023-02-17 01:25:44,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209992275] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:25:44,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:25:44,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 01:25:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202267442] [2023-02-17 01:25:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:25:44,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:25:44,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:25:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:25:44,092 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:44,190 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-02-17 01:25:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 01:25:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-02-17 01:25:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:44,192 INFO L225 Difference]: With dead ends: 36 [2023-02-17 01:25:44,192 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 01:25:44,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:25:44,193 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:25:44,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:25:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 01:25:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-02-17 01:25:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:25:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-17 01:25:44,210 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2023-02-17 01:25:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:44,210 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-17 01:25:44,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-17 01:25:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 01:25:44,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:44,212 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:44,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:25:44,417 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 01:25:44,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2048567935, now seen corresponding path program 1 times [2023-02-17 01:25:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:44,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119479214] [2023-02-17 01:25:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:44,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:25:44,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395626697] [2023-02-17 01:25:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:44,429 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 01:25:44,441 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 01:25:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:44,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 01:25:44,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 01:25:44,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:25:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:44,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119479214] [2023-02-17 01:25:44,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:25:44,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395626697] [2023-02-17 01:25:44,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395626697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:25:44,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:25:44,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 01:25:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571028992] [2023-02-17 01:25:44,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:25:44,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:25:44,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:44,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:25:44,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:25:44,541 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:25:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:44,937 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2023-02-17 01:25:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:25:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2023-02-17 01:25:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:44,938 INFO L225 Difference]: With dead ends: 73 [2023-02-17 01:25:44,938 INFO L226 Difference]: Without dead ends: 49 [2023-02-17 01:25:44,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-17 01:25:44,939 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 01:25:44,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 01:25:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-17 01:25:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2023-02-17 01:25:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 6 states have call successors, (6), 3 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 01:25:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-02-17 01:25:44,964 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 30 [2023-02-17 01:25:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:44,965 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-02-17 01:25:44,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 01:25:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2023-02-17 01:25:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 01:25:44,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:25:44,966 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:44,976 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 01:25:45,173 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 01:25:45,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:25:45,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:25:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 460220033, now seen corresponding path program 1 times [2023-02-17 01:25:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:25:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099977544] [2023-02-17 01:25:45,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:25:45,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:25:45,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019870658] [2023-02-17 01:25:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:25:45,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:25:45,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:25:45,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 01:25:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:25:45,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 01:25:45,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:25:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 01:25:45,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:25:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 01:25:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:25:45,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099977544] [2023-02-17 01:25:45,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:25:45,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019870658] [2023-02-17 01:25:45,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019870658] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 01:25:45,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:25:45,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2023-02-17 01:25:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033054903] [2023-02-17 01:25:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:25:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:25:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:25:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:25:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:25:45,307 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:25:45,416 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-17 01:25:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 01:25:45,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-02-17 01:25:45,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:25:45,417 INFO L225 Difference]: With dead ends: 39 [2023-02-17 01:25:45,417 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 01:25:45,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-17 01:25:45,418 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 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 01:25:45,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:25:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 01:25:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 01:25:45,419 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 01:25:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 01:25:45,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-02-17 01:25:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:25:45,420 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 01:25:45,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 01:25:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 01:25:45,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 01:25:45,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:25:45,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 01:25:45,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:25:45,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 01:25:45,649 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse37 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse6 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse27 (= .cse37 0))) (let ((.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (not .cse27)) (.cse38 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse8 (not .cse6)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse5 (not .cse41)) (.cse10 (and .cse8 .cse41)) (.cse9 (and .cse7 .cse38)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse1) (and (not .cse1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (not (= |ULTIMATE.start_main_~a~0#1| 0)))) (let ((.cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (let ((.cse40 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse39 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse20 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse19 (or (and .cse1 .cse3) (and .cse1 .cse39 .cse3) (and .cse1 .cse3 (or (= |ULTIMATE.start_main_~q~0#1| .cse20) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) .cse4))))) (.cse30 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20))) (or (let ((.cse21 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse22 (= .cse21 0)) (.cse13 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse18 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse17 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse16 (or (not .cse18) .cse17)) (.cse11 (or .cse22 (not .cse13))) (.cse14 (not .cse22))) (and (let ((.cse12 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse11 (= |ULTIMATE.start_main_~b~0#1| .cse12)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse12)) .cse13 .cse14))) (let ((.cse15 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse16) (and (not .cse17) .cse18 (= (+ .cse15 1) |ULTIMATE.start_main_~a~0#1|)))) .cse19 .cse1 (= (+ (* .cse20 1) |ULTIMATE.start_main_~q~0#1|) .cse20) .cse17 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse16 (or (and .cse11 (<= .cse21 0)) (and .cse13 (<= (+ (- 2) .cse21) 0) .cse14)))))) (let ((.cse35 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse33 (+ 1 .cse36)) (.cse32 (+ .cse35 1)) (.cse34 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse24 (not .cse38))) (let ((.cse23 (and (or (not (<= .cse37 0)) .cse9) (or .cse24 (not (<= (+ (- 2) .cse37) 0)) .cse27))) (.cse29 (* (* .cse35 .cse36) .cse34)) (.cse28 (* (* .cse32 .cse36) .cse34)) (.cse26 (* .cse34 (* .cse35 .cse33))) (.cse25 (* (* .cse32 .cse33) .cse34))) (and (or .cse8 .cse23 (and (or .cse24 (and (or .cse5 (= (+ .cse25 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse6) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse26) .cse20) .cse10)) .cse27) (or (and (or .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse20) .cse6) (or (= (+ .cse29 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse10)) .cse9)) .cse10) .cse19 .cse1 .cse30 (or .cse8 .cse23 (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse20))) (and (or (and (or (= (+ .cse29 .cse31) .cse20) .cse10) (or (= .cse20 (+ .cse28 .cse31)) .cse5 .cse6)) .cse9) (or .cse24 (and (or (= (+ .cse26 .cse31) .cse20) .cse10) (or .cse5 .cse6 (= (+ .cse25 .cse31) .cse20))) .cse27))) .cse10) .cse3)))) (and .cse19 .cse1 .cse30 .cse3) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 .cse39 (= |ULTIMATE.start_main_~q~0#1| 0) .cse30 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20)))))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and (<= 0 1) .cse0 (or .cse5 .cse6) .cse1 .cse4 .cse6 .cse3 (< 1 2)) (and .cse0 .cse1 .cse4 (or .cse7 .cse8 .cse9 .cse10) .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse3))))))) [2023-02-17 01:25:45,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 01:25:45,650 INFO L899 garLoopResultBuilder]: For program point L33-1(lines 32 53) no Hoare annotation was computed. [2023-02-17 01:25:45,650 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-02-17 01:25:45,650 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 52) no Hoare annotation was computed. [2023-02-17 01:25:45,650 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 01:25:45,650 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2023-02-17 01:25:45,650 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 19 58) the Hoare annotation is: true [2023-02-17 01:25:45,651 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 52) no Hoare annotation was computed. [2023-02-17 01:25:45,651 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 01:25:45,651 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 53) the Hoare annotation is: (let ((.cse39 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse29 (= .cse39 0))) (let ((.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (not .cse29)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse6 (not .cse11)) (.cse42 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse10 (not .cse42)) (.cse8 (and .cse6 .cse42)) (.cse7 (and .cse5 .cse40)) (.cse9 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2) (and (not .cse2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse0 (or (= |ULTIMATE.start_main_~b~0#1| 0) .cse12)) (.cse1 (let ((.cse22 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (let ((.cse41 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22))) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22)) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)))))) (or (and .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse41 .cse3 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (and .cse2 .cse41 .cse3)))) (.cse32 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (or (let ((.cse23 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse24 (= .cse23 0)) (.cse16 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse21 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse20 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse19 (or (not .cse21) .cse20)) (.cse14 (or .cse24 (not .cse16))) (.cse17 (not .cse24))) (and .cse13 (let ((.cse15 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse14 (= |ULTIMATE.start_main_~b~0#1| .cse15)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse15)) .cse16 .cse17))) (let ((.cse18 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse18 |ULTIMATE.start_main_~a~0#1|) .cse19) (and (not .cse20) .cse21 (= (+ .cse18 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 (= (+ (* .cse22 1) |ULTIMATE.start_main_~q~0#1|) .cse22) .cse20 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse19 (or (and .cse14 (<= .cse23 0)) (and .cse16 (<= (+ (- 2) .cse23) 0) .cse17)))))) (let ((.cse37 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse38 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse35 (+ 1 .cse38)) (.cse34 (+ .cse37 1)) (.cse36 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse26 (not .cse40))) (let ((.cse25 (and (or (not (<= .cse39 0)) .cse7) (or .cse26 (not (<= (+ (- 2) .cse39) 0)) .cse29))) (.cse31 (* (* .cse37 .cse38) .cse36)) (.cse30 (* (* .cse34 .cse38) .cse36)) (.cse28 (* .cse36 (* .cse37 .cse35))) (.cse27 (* (* .cse34 .cse35) .cse36))) (and .cse13 (or .cse6 .cse25 (and (or .cse26 (and (or .cse10 (= (+ .cse27 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse11) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse22) .cse8)) .cse29) (or (and (or .cse10 (= (+ |ULTIMATE.start_main_~q~0#1| .cse30) .cse22) .cse11) (or (= (+ .cse31 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse8)) .cse7)) .cse8) .cse2 .cse32 (or .cse6 .cse25 (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse22))) (and (or (and (or (= (+ .cse31 .cse33) .cse22) .cse8) (or (= .cse22 (+ .cse30 .cse33)) .cse10 .cse11)) .cse7) (or .cse26 (and (or (= (+ .cse28 .cse33) .cse22) .cse8) (or .cse10 .cse11 (= (+ .cse27 .cse33) .cse22))) .cse29))) .cse8) .cse3)))) (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse32 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (.cse4 (not .cse12))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse3) (and (or (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 (or .cse5 .cse6 .cse7 .cse8) .cse3)) (= .cse9 0)) (and (<= 0 1) .cse0 .cse1 (or .cse10 .cse11) .cse2 .cse4 .cse11 .cse3 (< 1 2)))))))) [2023-02-17 01:25:45,652 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 01:25:45,652 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse39 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse11 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse29 (= .cse39 0))) (let ((.cse2 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse5 (not .cse29)) (.cse40 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse6 (not .cse11)) (.cse42 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse10 (not .cse42)) (.cse8 (and .cse6 .cse42)) (.cse7 (and .cse5 .cse40)) (.cse9 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse2) (and (not .cse2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse12 (= |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse0 (or (= |ULTIMATE.start_main_~b~0#1| 0) .cse12)) (.cse1 (let ((.cse22 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse13 (let ((.cse41 (or (and (<= |ULTIMATE.start_main_~y~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~a~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22))) (exists ((|ULTIMATE.start_main_~b~0#1| Int)) (and (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* (* |ULTIMATE.start_main_~b~0#1| 0) |ULTIMATE.start_main_~p~0#1|) |ULTIMATE.start_main_~q~0#1|) .cse22)) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)))))) (or (and .cse2 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) .cse41 .cse3 (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (and .cse2 .cse41 .cse3)))) (.cse32 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse9) |ULTIMATE.start_main_~q~0#1|) .cse22))) (or (let ((.cse23 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse24 (= .cse23 0)) (.cse16 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse21 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse20 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse19 (or (not .cse21) .cse20)) (.cse14 (or .cse24 (not .cse16))) (.cse17 (not .cse24))) (and .cse13 (let ((.cse15 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse14 (= |ULTIMATE.start_main_~b~0#1| .cse15)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse15)) .cse16 .cse17))) (let ((.cse18 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse18 |ULTIMATE.start_main_~a~0#1|) .cse19) (and (not .cse20) .cse21 (= (+ .cse18 1) |ULTIMATE.start_main_~a~0#1|)))) .cse2 (= (+ (* .cse22 1) |ULTIMATE.start_main_~q~0#1|) .cse22) .cse20 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse19 (or (and .cse14 (<= .cse23 0)) (and .cse16 (<= (+ (- 2) .cse23) 0) .cse17)))))) (let ((.cse37 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse38 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse35 (+ 1 .cse38)) (.cse34 (+ .cse37 1)) (.cse36 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse26 (not .cse40))) (let ((.cse25 (and (or (not (<= .cse39 0)) .cse7) (or .cse26 (not (<= (+ (- 2) .cse39) 0)) .cse29))) (.cse31 (* (* .cse37 .cse38) .cse36)) (.cse30 (* (* .cse34 .cse38) .cse36)) (.cse28 (* .cse36 (* .cse37 .cse35))) (.cse27 (* (* .cse34 .cse35) .cse36))) (and .cse13 (or .cse6 .cse25 (and (or .cse26 (and (or .cse10 (= (+ .cse27 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse11) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse22) .cse8)) .cse29) (or (and (or .cse10 (= (+ |ULTIMATE.start_main_~q~0#1| .cse30) .cse22) .cse11) (or (= (+ .cse31 |ULTIMATE.start_main_~q~0#1|) .cse22) .cse8)) .cse7)) .cse8) .cse2 .cse32 (or .cse6 .cse25 (let ((.cse33 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse22))) (and (or (and (or (= (+ .cse31 .cse33) .cse22) .cse8) (or (= .cse22 (+ .cse30 .cse33)) .cse10 .cse11)) .cse7) (or .cse26 (and (or (= (+ .cse28 .cse33) .cse22) .cse8) (or .cse10 .cse11 (= (+ .cse27 .cse33) .cse22))) .cse29))) .cse8) .cse3)))) (and (= |ULTIMATE.start_main_~p~0#1| 1) .cse13 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse2 .cse32 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|)))))) (.cse4 (not .cse12))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|) .cse3) (and (or (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 (or .cse5 .cse6 .cse7 .cse8) .cse3)) (= .cse9 0)) (and (<= 0 1) .cse0 .cse1 (or .cse10 .cse11) .cse2 .cse4 .cse11 .cse3 (< 1 2)))))))) [2023-02-17 01:25:45,652 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 52) no Hoare annotation was computed. [2023-02-17 01:25:45,653 INFO L895 garLoopResultBuilder]: At program point L45-2(lines 32 53) the Hoare annotation is: (let ((.cse37 (mod |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse6 (= (mod |ULTIMATE.start_main_~a~0#1| 2) 0)) (.cse27 (= .cse37 0))) (let ((.cse1 (>= |ULTIMATE.start_main_~y~0#1| 1)) (.cse7 (not .cse27)) (.cse38 (< |ULTIMATE.start_main_~b~0#1| 0)) (.cse8 (not .cse6)) (.cse41 (< |ULTIMATE.start_main_~a~0#1| 0))) (let ((.cse5 (not .cse41)) (.cse10 (and .cse8 .cse41)) (.cse9 (and .cse7 .cse38)) (.cse3 (or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse1) (and (not .cse1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))) (.cse4 (not (= |ULTIMATE.start_main_~a~0#1| 0)))) (let ((.cse2 (<= 1 |ULTIMATE.start_main_~b~0#1|)) (.cse0 (let ((.cse40 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse39 (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|)) (.cse20 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse19 (or (and .cse1 .cse3) (and .cse1 .cse39 .cse3) (and .cse1 .cse3 (or (= |ULTIMATE.start_main_~q~0#1| .cse20) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) .cse4))))) (.cse30 (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20))) (or (let ((.cse21 (mod |ULTIMATE.start_main_~y~0#1| 2))) (let ((.cse22 (= .cse21 0)) (.cse13 (< |ULTIMATE.start_main_~y~0#1| 0)) (.cse18 (< |ULTIMATE.start_main_~x~0#1| 0)) (.cse17 (= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))) (let ((.cse16 (or (not .cse18) .cse17)) (.cse11 (or .cse22 (not .cse13))) (.cse14 (not .cse22))) (and (let ((.cse12 (div |ULTIMATE.start_main_~y~0#1| 2))) (or (and .cse11 (= |ULTIMATE.start_main_~b~0#1| .cse12)) (and (= |ULTIMATE.start_main_~b~0#1| (+ 1 .cse12)) .cse13 .cse14))) (let ((.cse15 (div |ULTIMATE.start_main_~x~0#1| 2))) (or (and (= .cse15 |ULTIMATE.start_main_~a~0#1|) .cse16) (and (not .cse17) .cse18 (= (+ .cse15 1) |ULTIMATE.start_main_~a~0#1|)))) .cse19 .cse1 (= (+ (* .cse20 1) |ULTIMATE.start_main_~q~0#1|) .cse20) .cse17 .cse3 (= (* 4 1) |ULTIMATE.start_main_~p~0#1|) .cse16 (or (and .cse11 (<= .cse21 0)) (and .cse13 (<= (+ (- 2) .cse21) 0) .cse14)))))) (let ((.cse35 (div |ULTIMATE.start_main_~a~0#1| 2)) (.cse36 (div |ULTIMATE.start_main_~b~0#1| 2))) (let ((.cse33 (+ 1 .cse36)) (.cse32 (+ .cse35 1)) (.cse34 (* |ULTIMATE.start_main_~p~0#1| 4)) (.cse24 (not .cse38))) (let ((.cse23 (and (or (not (<= .cse37 0)) .cse9) (or .cse24 (not (<= (+ (- 2) .cse37) 0)) .cse27))) (.cse29 (* (* .cse35 .cse36) .cse34)) (.cse28 (* (* .cse32 .cse36) .cse34)) (.cse26 (* .cse34 (* .cse35 .cse33))) (.cse25 (* (* .cse32 .cse33) .cse34))) (and (or .cse8 .cse23 (and (or .cse24 (and (or .cse5 (= (+ .cse25 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse6) (or (= (+ |ULTIMATE.start_main_~q~0#1| .cse26) .cse20) .cse10)) .cse27) (or (and (or .cse5 (= (+ |ULTIMATE.start_main_~q~0#1| .cse28) .cse20) .cse6) (or (= (+ .cse29 |ULTIMATE.start_main_~q~0#1|) .cse20) .cse10)) .cse9)) .cse10) .cse19 .cse1 .cse30 (or .cse8 .cse23 (let ((.cse31 (+ (* (- 1) |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~p~0#1|) .cse20))) (and (or (and (or (= (+ .cse29 .cse31) .cse20) .cse10) (or (= .cse20 (+ .cse28 .cse31)) .cse5 .cse6)) .cse9) (or .cse24 (and (or (= (+ .cse26 .cse31) .cse20) .cse10) (or .cse5 .cse6 (= (+ .cse25 .cse31) .cse20))) .cse27))) .cse10) .cse3)))) (and .cse19 .cse1 .cse30 .cse3) (and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) .cse1 .cse39 (= |ULTIMATE.start_main_~q~0#1| 0) .cse30 .cse3 (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (exists ((|ULTIMATE.start_main_~p~0#1| Int)) (= (+ (* |ULTIMATE.start_main_~p~0#1| .cse40) |ULTIMATE.start_main_~q~0#1|) .cse20)))))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and (<= 0 1) .cse0 (or .cse5 .cse6) .cse1 .cse4 .cse6 .cse3 (< 1 2)) (and .cse0 .cse1 .cse4 (or .cse7 .cse8 .cse9 .cse10) .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse3))))))) [2023-02-17 01:25:45,653 INFO L899 garLoopResultBuilder]: For program point L8(lines 8 10) no Hoare annotation was computed. [2023-02-17 01:25:45,653 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-02-17 01:25:45,653 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-02-17 01:25:45,654 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-02-17 01:25:45,654 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-02-17 01:25:45,654 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: (let ((.cse2 (= |__VERIFIER_assert_#in~cond| 1))) (let ((.cse5 (not .cse2))) (and (let ((.cse0 (< 0 2))) (let ((.cse1 (or .cse2 (and .cse0 .cse2)))) (or (and .cse0 .cse1 .cse2) (let ((.cse4 (not .cse0))) (let ((.cse3 (and .cse5 (or .cse5 .cse4)))) (and (or .cse3 .cse4) (or .cse3 .cse5 .cse4)))) (and .cse0 .cse1)))) (let ((.cse6 (<= 1 0))) (or (and (or (not .cse6) .cse5) .cse5) (and .cse6 .cse2) .cse2))))) [2023-02-17 01:25:45,654 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-02-17 01:25:45,657 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:25:45,659 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:25:45,667 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,670 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,695 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:25:45 BoogieIcfgContainer [2023-02-17 01:25:45,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:25:45,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:25:45,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:25:45,708 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:25:45,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:25:36" (3/4) ... [2023-02-17 01:25:45,711 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 01:25:45,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-17 01:25:45,719 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-02-17 01:25:45,719 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 01:25:45,719 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 01:25:45,720 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 01:25:45,739 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((0 <= 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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)))) && (!(a < 0) || a % 2 == 0)) && y >= 1) && !(a == 0)) && a % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 1 < 2)) || (((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && (((!(b % 2 == 0) || !(a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) [2023-02-17 01:25:45,747 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:25:45,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:25:45,748 INFO L158 Benchmark]: Toolchain (without parser) took 10146.43ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 71.2MB in the beginning and 124.9MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:25:45,748 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:25:45,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.59ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 60.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:25:45,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.92ms. Allocated memory is still 115.3MB. Free memory was 60.4MB in the beginning and 59.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:25:45,748 INFO L158 Benchmark]: Boogie Preprocessor took 46.53ms. Allocated memory is still 115.3MB. Free memory was 59.0MB in the beginning and 57.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:25:45,749 INFO L158 Benchmark]: RCFGBuilder took 348.84ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 57.5MB in the beginning and 109.2MB in the end (delta: -51.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-02-17 01:25:45,749 INFO L158 Benchmark]: TraceAbstraction took 9484.56ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 109.8MB in the beginning and 128.0MB in the end (delta: -18.3MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2023-02-17 01:25:45,749 INFO L158 Benchmark]: Witness Printer took 39.72ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 124.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:25:45,751 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.19ms. Allocated memory is still 115.3MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.59ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 60.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.92ms. Allocated memory is still 115.3MB. Free memory was 60.4MB in the beginning and 59.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.53ms. Allocated memory is still 115.3MB. Free memory was 59.0MB in the beginning and 57.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.84ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 57.5MB in the beginning and 109.2MB in the end (delta: -51.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9484.56ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 109.8MB in the beginning and 128.0MB in the end (delta: -18.3MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. * Witness Printer took 39.72ms. Allocated memory is still 167.8MB. Free memory was 128.0MB in the beginning and 124.9MB in the end (delta: 3.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] - 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] - 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 130 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 55, 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, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 21 PreInvPairs, 36 NumberOfFragments, 22266 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 182 ConstructedInterpolants, 4 QuantifiedInterpolants, 2320 SizeOfPredicates, 39 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 65/83 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: 32]: Loop Invariant [2023-02-17 01:25:45,769 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,770 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,770 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,770 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] [2023-02-17 01:25:45,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~p~0#1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((0 <= 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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y)))) && (!(a < 0) || a % 2 == 0)) && y >= 1) && !(a == 0)) && a % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 1 < 2)) || (((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && !(a == 0)) && (((!(b % 2 == 0) || !(a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && 1 <= b) && !(a == 0)) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || (((((((((((((((((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 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && x * y * 1 + q == x * y) && x % 2 == 0) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && 4 * 1 == p) && (!(x < 0) || x % 2 == 0)) && (((y % 2 == 0 || !(y < 0)) && y % 2 <= 0) || ((y < 0 && -2 + y % 2 <= 0) && !(y % 2 == 0)))) || ((((((((!(a % 2 == 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)))) || (!(a % 2 == 0) && a < 0)) && (((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0)))))) && y >= 1) && p * (a * b) + q == x * y) && (((!(a % 2 == 0) || ((!(b % 2 <= 0) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || !(-2 + b % 2 <= 0)) || b % 2 == 0))) || ((((a / 2 * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((x * y == (a / 2 + 1) * (b / 2) * (p * 4) + (-1 * a * b * p + x * y) || !(a < 0)) || a % 2 == 0)) || (!(b % 2 == 0) && b < 0)) && ((!(b < 0) || ((p * 4 * (a / 2 * (1 + b / 2)) + (-1 * a * b * p + x * y) == x * y || (!(a % 2 == 0) && a < 0)) && ((!(a < 0) || a % 2 == 0) || (a / 2 + 1) * (1 + b / 2) * (p * 4) + (-1 * a * b * p + x * y) == x * y))) || b % 2 == 0))) || (!(a % 2 == 0) && a < 0))) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) || ((y >= 1 && y <= b) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((y >= 1 && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && (q == x * y || (!(b == 0) && !(a == 0))))) && y >= 1) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0)))) || ((((((((p == 1 && b == y) && y >= 1) && y <= b) && q == 0) && p * (a * b) + q == x * y) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) && a == x) && (\exists ULTIMATE.start_main_~p~0#1 : int :: ULTIMATE.start_main_~p~0#1 * (a * b) + q == x * y))) && y >= 1) && ((cond == 1 && y >= 1) || (!(y >= 1) && cond == 0))) RESULT: Ultimate proved your program to be correct! [2023-02-17 01:25:45,800 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