./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.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 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:13:20,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:13:20,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:13:20,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:13:20,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:13:20,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:13:20,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:13:20,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:13:20,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:13:20,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:13:20,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:13:20,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:13:20,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:13:20,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:13:20,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:13:20,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:13:20,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:13:20,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:13:20,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:13:20,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:13:20,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:13:20,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:13:20,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:13:20,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:13:20,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:13:20,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:13:20,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:13:20,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:13:20,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:13:20,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:13:20,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:13:20,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:13:20,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:13:20,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:13:20,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:13:20,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:13:20,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:13:20,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:13:20,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:13:20,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:13:20,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:13:20,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:13:20,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:13:20,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:13:20,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:13:20,552 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:13:20,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:13:20,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:13:20,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:13:20,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:13:20,553 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:13:20,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:13:20,554 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:13:20,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:13:20,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:13:20,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:13:20,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:13:20,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:13:20,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:13:20,555 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:13:20,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:13:20,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:13:20,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:13:20,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:13:20,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:13:20,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:13:20,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:13:20,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:13:20,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:13:20,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:13:20,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:13:20,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:13:20,558 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:13:20,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:13:20,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:13:20,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 86018b7f3e582b94d83913c12d8eaea893434e1e96da49ea035805521496eb67 [2022-02-20 17:13:20,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:13:20,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:13:20,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:13:20,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:13:20,787 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:13:20,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-02-20 17:13:20,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5e6c94b/8f91a8314f014d82bdfa3157891b69e9/FLAG8420d11e1 [2022-02-20 17:13:21,257 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:13:21,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2022-02-20 17:13:21,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5e6c94b/8f91a8314f014d82bdfa3157891b69e9/FLAG8420d11e1 [2022-02-20 17:13:21,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5e6c94b/8f91a8314f014d82bdfa3157891b69e9 [2022-02-20 17:13:21,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:13:21,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:13:21,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:13:21,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:13:21,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:13:21,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff0edae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21, skipping insertion in model container [2022-02-20 17:13:21,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:13:21,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:13:21,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-02-20 17:13:21,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:13:21,501 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:13:21,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2022-02-20 17:13:21,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:13:21,543 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:13:21,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21 WrapperNode [2022-02-20 17:13:21,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:13:21,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:13:21,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:13:21,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:13:21,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,577 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-02-20 17:13:21,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:13:21,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:13:21,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:13:21,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:13:21,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:13:21,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:13:21,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:13:21,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:13:21,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (1/1) ... [2022-02-20 17:13:21,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:13:21,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:13:21,647 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) [2022-02-20 17:13:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:13:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:13:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:13:21,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:13:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:13:21,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:13:21,665 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 [2022-02-20 17:13:21,739 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:13:21,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:13:21,931 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:13:21,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:13:21,935 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:13:21,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:13:21 BoogieIcfgContainer [2022-02-20 17:13:21,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:13:21,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:13:21,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:13:21,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:13:21,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:13:21" (1/3) ... [2022-02-20 17:13:21,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5bda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:13:21, skipping insertion in model container [2022-02-20 17:13:21,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:13:21" (2/3) ... [2022-02-20 17:13:21,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5bda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:13:21, skipping insertion in model container [2022-02-20 17:13:21,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:13:21" (3/3) ... [2022-02-20 17:13:21,951 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2022-02-20 17:13:21,954 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:13:21,954 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:13:22,005 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:13:22,009 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:13:22,012 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:13:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:13:22,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:13:22,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:13:22,033 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:13:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:13:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-02-20 17:13:22,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:13:22,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098848608] [2022-02-20 17:13:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:13:22,147 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:13:22,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364694175] [2022-02-20 17:13:22,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:22,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:13:22,164 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) [2022-02-20 17:13:22,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:13:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:22,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:13:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:22,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:13:22,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23#true} is VALID [2022-02-20 17:13:22,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {31#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:22,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {31#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:22,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {38#(and (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~yx~0#1| 0))} is VALID [2022-02-20 17:13:22,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#(and (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~yx~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {42#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:13:22,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:13:22,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24#false} is VALID [2022-02-20 17:13:22,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 17:13:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:13:22,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:13:22,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:13:22,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098848608] [2022-02-20 17:13:22,385 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:13:22,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364694175] [2022-02-20 17:13:22,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364694175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:13:22,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:13:22,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:13:22,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929063227] [2022-02-20 17:13:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:13:22,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:13:22,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:13:22,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:13:22,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:22,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:13:22,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:13:22,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:13:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:13:22,427 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:13:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:22,669 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-02-20 17:13:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:13:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:13:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:13:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:13:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-02-20 17:13:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:13:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-02-20 17:13:22,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-02-20 17:13:22,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:22,754 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:13:22,754 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:13:22,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:13:22,759 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:13:22,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:13:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:13:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-20 17:13:22,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:13:22,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:22,789 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:22,790 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:22,793 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 17:13:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 17:13:22,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:22,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:22,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 17:13:22,795 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-02-20 17:13:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:22,797 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 17:13:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 17:13:22,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:22,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:22,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:13:22,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:13:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 17:13:22,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-02-20 17:13:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:13:22,803 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 17:13:22,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:13:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 17:13:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:13:22,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:13:22,806 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:13:22,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:13:23,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:13:23,022 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:13:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:13:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-02-20 17:13:23,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:13:23,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130224508] [2022-02-20 17:13:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:13:23,041 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:13:23,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [156537863] [2022-02-20 17:13:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:23,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:23,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:13:23,043 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) [2022-02-20 17:13:23,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:13:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:23,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:13:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:23,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:13:23,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {206#true} is VALID [2022-02-20 17:13:23,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:23,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:23,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:23,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {206#true} is VALID [2022-02-20 17:13:23,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 17:13:23,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 17:13:23,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 17:13:23,276 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {206#true} {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #47#return; {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:23,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 <= main_~X~0#1); {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:23,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(and (= (+ (* (- 1) |ULTIMATE.start_main_~X~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {242#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:23,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {242#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {246#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:13:23,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {246#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:13:23,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {253#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} is VALID [2022-02-20 17:13:23,280 INFO L272 TraceCheckUtils]: 14: Hoare triple {253#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= |ULTIMATE.start_main_~xy~0#1| 0) (= (+ (* |ULTIMATE.start_main_~Y~0#1| 4) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) |ULTIMATE.start_main_~v~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:13:23,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:13:23,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {207#false} is VALID [2022-02-20 17:13:23,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-02-20 17:13:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:13:23,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:13:23,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-02-20 17:13:23,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {207#false} is VALID [2022-02-20 17:13:23,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:13:23,440 INFO L272 TraceCheckUtils]: 14: Hoare triple {277#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:13:23,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {277#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {288#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !!(main_~x~0#1 <= main_~X~0#1); {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,449 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {206#true} {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} #47#return; {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 17:13:23,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 17:13:23,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 17:13:23,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {206#true} is VALID [2022-02-20 17:13:23,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {281#(= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:23,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {206#true} is VALID [2022-02-20 17:13:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:13:23,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:13:23,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130224508] [2022-02-20 17:13:23,453 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:13:23,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156537863] [2022-02-20 17:13:23,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156537863] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:13:23,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:13:23,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-02-20 17:13:23,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688013740] [2022-02-20 17:13:23,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:13:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:13:23,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:13:23,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:23,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:23,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:13:23,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:13:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:13:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:13:23,485 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:23,897 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-02-20 17:13:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:13:23,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:13:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:13:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-02-20 17:13:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-02-20 17:13:23,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2022-02-20 17:13:23,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:23,975 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:13:23,975 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 17:13:23,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:13:23,978 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:13:23,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:13:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 17:13:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-02-20 17:13:23,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:13:23,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-02-20 17:13:23,991 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-02-20 17:13:23,991 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-02-20 17:13:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:23,994 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 17:13:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 17:13:23,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:23,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:23,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) Second operand 34 states. [2022-02-20 17:13:23,995 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) Second operand 34 states. [2022-02-20 17:13:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:24,001 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 17:13:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 17:13:24,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:24,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:24,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:13:24,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:13:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-02-20 17:13:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-20 17:13:24,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-02-20 17:13:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:13:24,003 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-20 17:13:24,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:13:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 17:13:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:13:24,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:13:24,011 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:13:24,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:13:24,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 17:13:24,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:13:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:13:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-02-20 17:13:24,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:13:24,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625682155] [2022-02-20 17:13:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:13:24,223 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:13:24,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993200974] [2022-02-20 17:13:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:24,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:24,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:13:24,225 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) [2022-02-20 17:13:24,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:13:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:24,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:13:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:24,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:13:24,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {496#(<= ~counter~0 0)} is VALID [2022-02-20 17:13:24,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {496#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {496#(<= ~counter~0 0)} is VALID [2022-02-20 17:13:24,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {496#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {503#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {503#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {503#(<= ~counter~0 1)} ~cond := #in~cond; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {503#(<= ~counter~0 1)} assume !(0 == ~cond); {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(<= ~counter~0 1)} assume true; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,357 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {503#(<= ~counter~0 1)} {503#(<= ~counter~0 1)} #47#return; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(<= ~counter~0 1)} assume !!(main_~x~0#1 <= main_~X~0#1); {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {503#(<= ~counter~0 1)} assume !(main_~v~0#1 < 0);main_~v~0#1 := main_~v~0#1 + 2 * (main_~Y~0#1 - main_~X~0#1);main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#(<= ~counter~0 1)} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {503#(<= ~counter~0 1)} is VALID [2022-02-20 17:13:24,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {503#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {534#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:13:24,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {492#false} is VALID [2022-02-20 17:13:24,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#false} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {492#false} is VALID [2022-02-20 17:13:24,359 INFO L272 TraceCheckUtils]: 15: Hoare triple {492#false} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {492#false} is VALID [2022-02-20 17:13:24,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-02-20 17:13:24,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-02-20 17:13:24,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-02-20 17:13:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:13:24,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:13:24,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-02-20 17:13:24,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-02-20 17:13:24,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-02-20 17:13:24,472 INFO L272 TraceCheckUtils]: 15: Hoare triple {492#false} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {492#false} is VALID [2022-02-20 17:13:24,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#false} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {492#false} is VALID [2022-02-20 17:13:24,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {568#(< |ULTIMATE.start_main_#t~post6#1| 100)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {492#false} is VALID [2022-02-20 17:13:24,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {572#(< ~counter~0 100)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {568#(< |ULTIMATE.start_main_#t~post6#1| 100)} is VALID [2022-02-20 17:13:24,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {572#(< ~counter~0 100)} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {572#(< ~counter~0 100)} is VALID [2022-02-20 17:13:24,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {572#(< ~counter~0 100)} assume !(main_~v~0#1 < 0);main_~v~0#1 := main_~v~0#1 + 2 * (main_~Y~0#1 - main_~X~0#1);main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {572#(< ~counter~0 100)} is VALID [2022-02-20 17:13:24,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(< ~counter~0 100)} assume !!(main_~x~0#1 <= main_~X~0#1); {572#(< ~counter~0 100)} is VALID [2022-02-20 17:13:24,474 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {491#true} {572#(< ~counter~0 100)} #47#return; {572#(< ~counter~0 100)} is VALID [2022-02-20 17:13:24,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} assume true; {491#true} is VALID [2022-02-20 17:13:24,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-02-20 17:13:24,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-02-20 17:13:24,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {572#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {491#true} is VALID [2022-02-20 17:13:24,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {572#(< ~counter~0 100)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {572#(< ~counter~0 100)} is VALID [2022-02-20 17:13:24,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#(< ~counter~0 99)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {572#(< ~counter~0 100)} is VALID [2022-02-20 17:13:24,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#(< ~counter~0 99)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {603#(< ~counter~0 99)} is VALID [2022-02-20 17:13:24,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {603#(< ~counter~0 99)} is VALID [2022-02-20 17:13:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:13:24,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:13:24,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625682155] [2022-02-20 17:13:24,478 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:13:24,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993200974] [2022-02-20 17:13:24,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993200974] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:13:24,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:13:24,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:13:24,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185828836] [2022-02-20 17:13:24,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:13:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) Word has length 19 [2022-02-20 17:13:24,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:13:24,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-02-20 17:13:24,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:24,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:13:24,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:13:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:13:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:13:24,503 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-02-20 17:13:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:24,664 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-02-20 17:13:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:13:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) Word has length 19 [2022-02-20 17:13:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:13:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-02-20 17:13:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 17:13:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-02-20 17:13:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2022-02-20 17:13:24,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2022-02-20 17:13:24,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:24,725 INFO L225 Difference]: With dead ends: 73 [2022-02-20 17:13:24,725 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:13:24,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:13:24,726 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:13:24,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 102 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:13:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:13:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-02-20 17:13:24,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:13:24,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:13:24,741 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:13:24,742 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:13:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:24,744 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-02-20 17:13:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-02-20 17:13:24,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:24,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:24,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 67 states. [2022-02-20 17:13:24,745 INFO L87 Difference]: Start difference. First operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 67 states. [2022-02-20 17:13:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:24,747 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-02-20 17:13:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-02-20 17:13:24,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:24,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:24,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:13:24,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:13:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:13:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-02-20 17:13:24,750 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-02-20 17:13:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:13:24,750 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-02-20 17:13:24,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) [2022-02-20 17:13:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-02-20 17:13:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:13:24,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:13:24,752 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:13:24,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:13:24,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:24,969 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:13:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:13:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-02-20 17:13:24,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:13:24,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426484604] [2022-02-20 17:13:24,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:13:24,983 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:13:24,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848999967] [2022-02-20 17:13:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:13:24,985 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) [2022-02-20 17:13:24,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:13:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:25,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 17:13:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:25,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:13:25,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {917#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {917#true} is VALID [2022-02-20 17:13:25,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:25,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:25,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:25,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {917#true} is VALID [2022-02-20 17:13:25,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~cond := #in~cond; {917#true} is VALID [2022-02-20 17:13:25,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} assume !(0 == ~cond); {917#true} is VALID [2022-02-20 17:13:25,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#true} assume true; {917#true} is VALID [2022-02-20 17:13:25,430 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {917#true} {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #47#return; {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:25,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {925#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~x~0#1 <= main_~X~0#1); {950#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:25,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !(main_~v~0#1 < 0);main_~v~0#1 := main_~v~0#1 + 2 * (main_~Y~0#1 - main_~X~0#1);main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {954#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:13:25,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {954#(and (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {958#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:13:25,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {958#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:13:25,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {965#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} is VALID [2022-02-20 17:13:25,433 INFO L272 TraceCheckUtils]: 14: Hoare triple {965#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {917#true} is VALID [2022-02-20 17:13:25,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#true} ~cond := #in~cond; {972#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:13:25,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {972#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:13:25,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {976#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:13:25,435 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {976#(not (= |__VERIFIER_assert_#in~cond| 0))} {965#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} #47#return; {983#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:13:25,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {983#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} assume !(main_~x~0#1 <= main_~X~0#1); {987#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} is VALID [2022-02-20 17:13:25,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {987#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= (+ (- 1) |ULTIMATE.start_main_~x~0#1|) 0) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|)) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~X~0#1| 1)))} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {991#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~Y~0#1| 4)) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= 1 |ULTIMATE.start_main_~X~0#1|)) (<= 0 |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~xy~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:13:25,439 INFO L272 TraceCheckUtils]: 21: Hoare triple {991#(and (= |ULTIMATE.start_main_~yx~0#1| |ULTIMATE.start_main_~Y~0#1|) (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~Y~0#1| 4)) (= |ULTIMATE.start_main_~y~0#1| 1) (not (<= 1 |ULTIMATE.start_main_~X~0#1|)) (<= 0 |ULTIMATE.start_main_~X~0#1|) (= |ULTIMATE.start_main_~xy~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {995#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:13:25,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {995#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {999#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:13:25,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {999#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {918#false} is VALID [2022-02-20 17:13:25,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-02-20 17:13:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:13:25,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:13:26,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-02-20 17:13:26,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {999#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {918#false} is VALID [2022-02-20 17:13:26,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {995#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {999#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:13:26,142 INFO L272 TraceCheckUtils]: 21: Hoare triple {1015#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {995#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:13:26,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {1019#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {1015#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:26,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {1023#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} assume !(main_~x~0#1 <= main_~X~0#1); {1019#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:13:26,145 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {976#(not (= |__VERIFIER_assert_#in~cond| 0))} {1027#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} #47#return; {1023#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} is VALID [2022-02-20 17:13:26,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {976#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:13:26,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {1037#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:13:26,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#true} ~cond := #in~cond; {1037#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:13:26,147 INFO L272 TraceCheckUtils]: 14: Hoare triple {1027#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {917#true} is VALID [2022-02-20 17:13:26,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1044#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1027#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))))} is VALID [2022-02-20 17:13:26,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1044#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1044#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))} is VALID [2022-02-20 17:13:26,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {1051#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) 2)))))} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1044#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))))))} is VALID [2022-02-20 17:13:26,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {1055#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* (- 2) (* (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~X~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* (+ |ULTIMATE.start_main_~y~0#1| 1) (+ |ULTIMATE.start_main_~x~0#1| 1)))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2 (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))))} assume !(main_~v~0#1 < 0);main_~v~0#1 := main_~v~0#1 + 2 * (main_~Y~0#1 - main_~X~0#1);main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1051#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)) (+ (* (- 2) (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) 2)))))} is VALID [2022-02-20 17:13:26,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {917#true} assume !!(main_~x~0#1 <= main_~X~0#1); {1055#(or (<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~X~0#1|) (forall ((|ULTIMATE.start_main_~Y~0#1| Int)) (= (+ (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* (- 2) (* (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~X~0#1|)) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* 2 (* (+ |ULTIMATE.start_main_~y~0#1| 1) (+ |ULTIMATE.start_main_~x~0#1| 1)))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2 (* 2 (* |ULTIMATE.start_main_~Y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))) (* 2 |ULTIMATE.start_main_~Y~0#1|)))))} is VALID [2022-02-20 17:13:26,153 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {917#true} {917#true} #47#return; {917#true} is VALID [2022-02-20 17:13:26,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#true} assume true; {917#true} is VALID [2022-02-20 17:13:26,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} assume !(0 == ~cond); {917#true} is VALID [2022-02-20 17:13:26,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~cond := #in~cond; {917#true} is VALID [2022-02-20 17:13:26,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {917#true} is VALID [2022-02-20 17:13:26,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {917#true} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {917#true} is VALID [2022-02-20 17:13:26,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {917#true} is VALID [2022-02-20 17:13:26,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {917#true} is VALID [2022-02-20 17:13:26,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {917#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {917#true} is VALID [2022-02-20 17:13:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:13:26,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:13:26,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426484604] [2022-02-20 17:13:26,155 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:13:26,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848999967] [2022-02-20 17:13:26,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848999967] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:13:26,156 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:13:26,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-02-20 17:13:26,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706911581] [2022-02-20 17:13:26,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:13:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2022-02-20 17:13:26,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:13:26,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:13:26,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:26,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 17:13:26,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:13:26,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 17:13:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:13:26,197 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:13:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:26,980 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-02-20 17:13:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 17:13:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2022-02-20 17:13:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:13:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:13:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-02-20 17:13:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:13:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-02-20 17:13:26,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 53 transitions. [2022-02-20 17:13:27,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:13:27,039 INFO L225 Difference]: With dead ends: 80 [2022-02-20 17:13:27,039 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 17:13:27,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 17:13:27,040 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:13:27,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 109 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-02-20 17:13:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 17:13:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2022-02-20 17:13:27,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:13:27,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:13:27,061 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:13:27,062 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:13:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:27,064 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-02-20 17:13:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-02-20 17:13:27,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:27,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:27,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-02-20 17:13:27,065 INFO L87 Difference]: Start difference. First operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 72 states. [2022-02-20 17:13:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:13:27,068 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-02-20 17:13:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-02-20 17:13:27,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:13:27,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:13:27,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:13:27,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:13:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:13:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-02-20 17:13:27,071 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 25 [2022-02-20 17:13:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:13:27,071 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-02-20 17:13:27,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:13:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-02-20 17:13:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:13:27,072 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:13:27,072 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:13:27,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:13:27,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:27,295 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:13:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:13:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2021783820, now seen corresponding path program 1 times [2022-02-20 17:13:27,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:13:27,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436059781] [2022-02-20 17:13:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:13:27,311 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:13:27,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547881782] [2022-02-20 17:13:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:13:27,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:13:27,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:13:27,318 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) [2022-02-20 17:13:27,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:13:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:27,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 17:13:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:13:27,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:27,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {1443#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1443#true} is VALID [2022-02-20 17:14:27,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {1443#true} is VALID [2022-02-20 17:14:27,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1443#true} ~cond := #in~cond; {1443#true} is VALID [2022-02-20 17:14:27,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {1443#true} assume !(0 == ~cond); {1443#true} is VALID [2022-02-20 17:14:27,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1443#true} assume true; {1443#true} is VALID [2022-02-20 17:14:27,319 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1443#true} {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} #47#return; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 <= main_~X~0#1); {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,321 INFO L272 TraceCheckUtils]: 14: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {1443#true} is VALID [2022-02-20 17:14:27,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {1443#true} ~cond := #in~cond; {1443#true} is VALID [2022-02-20 17:14:27,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {1443#true} assume !(0 == ~cond); {1443#true} is VALID [2022-02-20 17:14:27,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {1443#true} assume true; {1443#true} is VALID [2022-02-20 17:14:27,322 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1443#true} {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} #47#return; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 <= main_~X~0#1); {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:27,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1518#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} is VALID [2022-02-20 17:14:27,323 INFO L272 TraceCheckUtils]: 24: Hoare triple {1518#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {1443#true} is VALID [2022-02-20 17:14:27,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {1443#true} ~cond := #in~cond; {1525#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:27,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {1525#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:27,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:27,326 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} {1518#(and (= (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~xy~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (= (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~yx~0#1|))} #47#return; {1536#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:14:27,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {1536#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !(main_~x~0#1 <= main_~X~0#1); {1536#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:14:29,328 WARN L290 TraceCheckUtils]: 30: Hoare triple {1536#(and (= (+ (* (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1|) (+ (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 0))} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {1543#(and (or (and (= (mod (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* (- 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) 2) 0) (= (* |ULTIMATE.start_main_~Y~0#1| (div (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~yx~0#1|) (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~y~0#1| (div (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) |ULTIMATE.start_main_~Y~0#1|))) (= (mod (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) |ULTIMATE.start_main_~Y~0#1|) 0) (not (= |ULTIMATE.start_main_~Y~0#1| 0))) (and (= (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) 0) (= (mod (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* (- 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) 2) 0) (= |ULTIMATE.start_main_~xy~0#1| 0) (= |ULTIMATE.start_main_~yx~0#1| 0))) (= |ULTIMATE.start_main_~y~0#1| 0))} is UNKNOWN [2022-02-20 17:14:29,331 INFO L272 TraceCheckUtils]: 31: Hoare triple {1543#(and (or (and (= (mod (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* (- 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) 2) 0) (= (* |ULTIMATE.start_main_~Y~0#1| (div (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) |ULTIMATE.start_main_~Y~0#1|)) |ULTIMATE.start_main_~yx~0#1|) (= |ULTIMATE.start_main_~xy~0#1| (* |ULTIMATE.start_main_~y~0#1| (div (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) |ULTIMATE.start_main_~Y~0#1|))) (= (mod (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) |ULTIMATE.start_main_~Y~0#1|) 0) (not (= |ULTIMATE.start_main_~Y~0#1| 0))) (and (= (+ (* |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|) (* (- 1) |ULTIMATE.start_main_~Y~0#1|) (div (+ (* (- 1) |ULTIMATE.start_main_~v~0#1|) (* (- 1) |ULTIMATE.start_main_~X~0#1|)) (- 2))) 0) (= (mod (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* (- 2) |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~y~0#1|)) 2) 0) (= |ULTIMATE.start_main_~xy~0#1| 0) (= |ULTIMATE.start_main_~yx~0#1| 0))) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {1547#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:29,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {1547#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1551#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:29,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {1551#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1444#false} is VALID [2022-02-20 17:14:29,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {1444#false} assume !false; {1444#false} is VALID [2022-02-20 17:14:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:14:29,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:14:35,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {1444#false} assume !false; {1444#false} is VALID [2022-02-20 17:14:35,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {1551#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1444#false} is VALID [2022-02-20 17:14:35,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {1547#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1551#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:35,320 INFO L272 TraceCheckUtils]: 31: Hoare triple {1567#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 + 2 * main_~y~0#1 then 1 else 0)); {1547#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:35,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} main_~xy~0#1 := main_~x~0#1 * main_~y~0#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1; {1567#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 |ULTIMATE.start_main_~xy~0#1|)) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:14:35,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} assume !(main_~x~0#1 <= main_~X~0#1); {1571#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:14:35,322 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} {1578#(= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} #47#return; {1571#(= (+ |ULTIMATE.start_main_~X~0#1| |ULTIMATE.start_main_~v~0#1| (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:14:35,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:35,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {1588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:35,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {1443#true} ~cond := #in~cond; {1588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:14:35,324 INFO L272 TraceCheckUtils]: 24: Hoare triple {1578#(= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {1443#true} is VALID [2022-02-20 17:14:35,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1578#(= (+ (* 2 |ULTIMATE.start_main_~yx~0#1|) (* 2 |ULTIMATE.start_main_~Y~0#1|) (* (- 2) |ULTIMATE.start_main_~xy~0#1|) (* 2 (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) (* (* |ULTIMATE.start_main_~Y~0#1| |ULTIMATE.start_main_~x~0#1|) 2) (* 2 |ULTIMATE.start_main_~Y~0#1|)))} is VALID [2022-02-20 17:14:35,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 <= main_~X~0#1); {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,326 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1443#true} {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} #47#return; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {1443#true} assume true; {1443#true} is VALID [2022-02-20 17:14:35,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {1443#true} assume !(0 == ~cond); {1443#true} is VALID [2022-02-20 17:14:35,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {1443#true} ~cond := #in~cond; {1443#true} is VALID [2022-02-20 17:14:35,326 INFO L272 TraceCheckUtils]: 14: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {1443#true} is VALID [2022-02-20 17:14:35,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume main_~v~0#1 < 0;main_~v~0#1 := main_~v~0#1 + 2 * main_~Y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 <= main_~X~0#1); {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,329 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1443#true} {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} #47#return; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {1443#true} assume true; {1443#true} is VALID [2022-02-20 17:14:35,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {1443#true} assume !(0 == ~cond); {1443#true} is VALID [2022-02-20 17:14:35,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {1443#true} ~cond := #in~cond; {1443#true} is VALID [2022-02-20 17:14:35,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} call __VERIFIER_assert((if 0 == 2 * main_~yx~0#1 - 2 * main_~xy~0#1 - main_~X~0#1 + 2 * main_~Y~0#1 - main_~v~0#1 then 1 else 0)); {1443#true} is VALID [2022-02-20 17:14:35,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1;main_~yx~0#1 := main_~Y~0#1 * main_~x~0#1;main_~xy~0#1 := main_~X~0#1 * main_~y~0#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1443#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~X~0#1, main_~Y~0#1, main_~x~0#1, main_~y~0#1, main_~v~0#1, main_~xy~0#1, main_~yx~0#1;havoc main_~X~0#1;havoc main_~Y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~v~0#1;havoc main_~xy~0#1;havoc main_~yx~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~X~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~Y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~v~0#1 := 2 * main_~Y~0#1 - main_~X~0#1;main_~y~0#1 := 0;main_~x~0#1 := 0; {1451#(= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-20 17:14:35,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {1443#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1443#true} is VALID [2022-02-20 17:14:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:14:35,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:35,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436059781] [2022-02-20 17:14:35,331 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:35,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547881782] [2022-02-20 17:14:35,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547881782] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:14:35,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:14:35,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-02-20 17:14:35,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112571416] [2022-02-20 17:14:35,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:14:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-02-20 17:14:35,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:35,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:14:37,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:37,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:14:37,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:14:37,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:14:37,367 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:14:39,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []