./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound2.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/ps4-ll_valuebound2.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 68d290aa6e6a124b20d02df1a641bd7e739f143db7416cdcc7b7048aed53c326 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:15,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:15,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:15,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:15,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:15,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:15,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:15,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:15,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:15,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:15,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:15,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:15,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:15,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:15,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:15,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:15,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:15,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:15,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:15,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:15,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:15,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:15,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:15,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:15,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:15,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:15,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:15,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:15,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:15,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:15,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:15,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:15,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:15,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:15,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:15,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:15,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:15,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:15,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:15,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:15,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:15,573 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:41:15,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:15,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:15,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:15,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:15,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:15,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:15,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:15,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:15,600 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:15,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:15,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:15,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:15,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:15,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:15,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:15,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:15,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:15,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:15,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:15,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:15,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:15,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:15,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:15,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:15,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:15,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:15,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:15,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:15,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:15,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:15,606 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:15,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:15,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:15,606 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 -> 68d290aa6e6a124b20d02df1a641bd7e739f143db7416cdcc7b7048aed53c326 [2022-02-20 17:41:15,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:15,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:15,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:15,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:15,884 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:15,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound2.c [2022-02-20 17:41:15,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f29c4e92/2ade79846e1a4f96a8a572bc782a18df/FLAG3c34cabec [2022-02-20 17:41:16,366 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:16,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound2.c [2022-02-20 17:41:16,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f29c4e92/2ade79846e1a4f96a8a572bc782a18df/FLAG3c34cabec [2022-02-20 17:41:16,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f29c4e92/2ade79846e1a4f96a8a572bc782a18df [2022-02-20 17:41:16,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:16,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:16,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:16,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:16,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:16,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550c163e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16, skipping insertion in model container [2022-02-20 17:41:16,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:16,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:16,540 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/ps4-ll_valuebound2.c[458,471] [2022-02-20 17:41:16,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:16,576 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:16,586 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/ps4-ll_valuebound2.c[458,471] [2022-02-20 17:41:16,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:16,628 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:16,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16 WrapperNode [2022-02-20 17:41:16,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:16,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:16,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:16,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:16,636 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:41:16" (1/1) ... [2022-02-20 17:41:16,641 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:41:16" (1/1) ... [2022-02-20 17:41:16,659 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-02-20 17:41:16,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:16,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:16,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:16,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:16,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:16,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:16,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:16,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:16,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (1/1) ... [2022-02-20 17:41:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:16,724 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:41:16,750 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:41:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:16,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:16,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:16,831 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:16,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:16,954 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:16,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:16,958 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:16,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:16 BoogieIcfgContainer [2022-02-20 17:41:16,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:16,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:16,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:16,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:16,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:16" (1/3) ... [2022-02-20 17:41:16,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c07e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:16, skipping insertion in model container [2022-02-20 17:41:16,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:16" (2/3) ... [2022-02-20 17:41:16,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c07e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:16, skipping insertion in model container [2022-02-20 17:41:16,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:16" (3/3) ... [2022-02-20 17:41:16,965 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound2.c [2022-02-20 17:41:16,968 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:16,968 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:16,996 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:17,001 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:41:17,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:17,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:17,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:17,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2022-02-20 17:41:17,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:17,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828927475] [2022-02-20 17:41:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:17,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#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(9, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-02-20 17:41:17,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22#true} is VALID [2022-02-20 17:41:17,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {23#false} is VALID [2022-02-20 17:41:17,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#false} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {23#false} is VALID [2022-02-20 17:41:17,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#false} assume false; {23#false} is VALID [2022-02-20 17:41:17,133 INFO L272 TraceCheckUtils]: 5: Hoare triple {23#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {23#false} is VALID [2022-02-20 17:41:17,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-02-20 17:41:17,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-02-20 17:41:17,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 17:41:17,135 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:41:17,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:17,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828927475] [2022-02-20 17:41:17,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828927475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:17,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:17,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:17,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234578868] [2022-02-20 17:41:17,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:17,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:17,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:17,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:17,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:17,189 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,244 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-20 17:41:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:41:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:41:17,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-20 17:41:17,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:17,343 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:41:17,343 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:41:17,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:17,348 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:17,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:41:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:41:17,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:17,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:17,371 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:17,371 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,374 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:17,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:17,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:17,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 15 states. [2022-02-20 17:41:17,375 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 15 states. [2022-02-20 17:41:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,377 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:17,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:17,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:17,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:17,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:41:17,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-02-20 17:41:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:17,381 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:41:17,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:17,382 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:17,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:17,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:17,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:17,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:17,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2022-02-20 17:41:17,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:17,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802224911] [2022-02-20 17:41:17,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:17,398 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:17,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154548543] [2022-02-20 17:41:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:17,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:17,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:17,413 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:41:17,416 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:41:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:17,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:17,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:17,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(9, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-20 17:41:17,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {123#true} is VALID [2022-02-20 17:41:17,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume !(0 == assume_abort_if_not_~cond#1); {123#true} is VALID [2022-02-20 17:41:17,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:17,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:17,682 INFO L272 TraceCheckUtils]: 5: Hoare triple {137#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {144#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:17,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {148#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:17,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {124#false} is VALID [2022-02-20 17:41:17,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:41:17,683 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:41:17,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:17,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:17,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802224911] [2022-02-20 17:41:17,684 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:17,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154548543] [2022-02-20 17:41:17,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154548543] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:17,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:17,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:17,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418955016] [2022-02-20 17:41:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:17,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:17,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:17,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:17,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:17,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:17,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:17,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:17,695 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,817 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:41:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:17,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:41:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:41:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:41:17,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 17:41:17,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:17,855 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:17,855 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:41:17,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:41:17,856 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:17,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 51 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:41:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:41:17,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:17,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:17,862 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:17,862 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,864 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:17,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:17,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:17,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:17,865 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-02-20 17:41:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:17,867 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:17,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:17,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:17,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:17,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 17:41:17,869 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2022-02-20 17:41:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:17,869 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 17:41:17,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:17,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:17,870 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:17,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:41:18,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:18,076 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:18,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2022-02-20 17:41:18,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:18,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024305484] [2022-02-20 17:41:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:18,086 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:18,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294295070] [2022-02-20 17:41:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:18,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:18,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:18,092 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:41:18,094 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:41:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:18,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:18,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:18,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(9, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-02-20 17:41:18,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {266#true} is VALID [2022-02-20 17:41:18,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(0 == assume_abort_if_not_~cond#1); {266#true} is VALID [2022-02-20 17:41:18,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:18,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:18,306 INFO L272 TraceCheckUtils]: 5: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {266#true} is VALID [2022-02-20 17:41:18,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:41:18,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:41:18,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:41:18,307 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {266#true} {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #46#return; {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:18,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:41:18,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} assume !false; {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-20 17:41:18,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {302#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= 0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:18,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:18,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:41:18,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:41:18,310 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:41:18,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:42,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:41:42,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:41:42,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:42,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:42,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !false; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:42,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:42,248 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {266#true} {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} #46#return; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:42,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:41:42,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:41:42,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:41:42,248 INFO L272 TraceCheckUtils]: 5: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {266#true} is VALID [2022-02-20 17:41:42,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} assume !false; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:42,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {329#(= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4))} is VALID [2022-02-20 17:41:42,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume !(0 == assume_abort_if_not_~cond#1); {266#true} is VALID [2022-02-20 17:41:42,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {266#true} is VALID [2022-02-20 17:41:42,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(9, 2);call #Ultimate.allocInit(12, 3); {266#true} is VALID [2022-02-20 17:41:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:41:42,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:42,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024305484] [2022-02-20 17:41:42,260 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:42,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294295070] [2022-02-20 17:41:42,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294295070] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:42,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:42,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:42,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531852777] [2022-02-20 17:41:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:42,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:42,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:42,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:42,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:42,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:42,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:42,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-02-20 17:41:42,283 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:42,361 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 17:41:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:42,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:41:42,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:42,390 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:41:42,390 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:41:42,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-02-20 17:41:42,391 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:42,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:41:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:41:42,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:42,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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:41:42,397 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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:41:42,398 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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:41:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:42,399 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 17:41:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:42,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:42,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:42,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) Second operand 23 states. [2022-02-20 17:41:42,399 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) Second operand 23 states. [2022-02-20 17:41:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:42,400 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 17:41:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:42,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:42,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:42,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:42,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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:41:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-02-20 17:41:42,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2022-02-20 17:41:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:42,402 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-02-20 17:41:42,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:41:42,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:42,403 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:42,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:42,622 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,SelfDestructingSolverStorable2 [2022-02-20 17:41:42,623 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:42,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2022-02-20 17:41:42,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:42,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995762469] [2022-02-20 17:41:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:42,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:42,635 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:42,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [922568147] [2022-02-20 17:41:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:42,637 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:41:42,639 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:41:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:42,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:42,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:42,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#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(9, 2);call #Ultimate.allocInit(12, 3); {481#true} is VALID [2022-02-20 17:41:42,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {481#true} is VALID [2022-02-20 17:41:42,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume !(0 == assume_abort_if_not_~cond#1); {481#true} is VALID [2022-02-20 17:41:42,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {481#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,975 INFO L272 TraceCheckUtils]: 5: Hoare triple {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {481#true} is VALID [2022-02-20 17:41:42,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-02-20 17:41:42,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-02-20 17:41:42,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume true; {481#true} is VALID [2022-02-20 17:41:42,977 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {481#true} {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:42,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {495#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:42,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:42,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {481#true} is VALID [2022-02-20 17:41:42,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-02-20 17:41:42,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-02-20 17:41:42,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {481#true} assume true; {481#true} is VALID [2022-02-20 17:41:42,980 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {481#true} {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} #46#return; {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:42,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {539#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:42,981 INFO L272 TraceCheckUtils]: 18: Hoare triple {539#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:42,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {543#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:42,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {482#false} is VALID [2022-02-20 17:41:42,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-02-20 17:41:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:41:42,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:43,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:43,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995762469] [2022-02-20 17:41:43,282 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:43,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922568147] [2022-02-20 17:41:43,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922568147] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:43,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:43,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:41:43,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963406413] [2022-02-20 17:41:43,283 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:43,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:43,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:43,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:43,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:43,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:43,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:43,302 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:43,447 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 17:41:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:41:43,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 17:41:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:41:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:41:43,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-02-20 17:41:43,489 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:41:43,490 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:41:43,490 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:41:43,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:41:43,491 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:43,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:41:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:41:43,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:43,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:41:43,500 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:41:43,500 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:41:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:43,501 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 17:41:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:43,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:43,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:43,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 26 states. [2022-02-20 17:41:43,502 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 26 states. [2022-02-20 17:41:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:43,503 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 17:41:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:43,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:43,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:43,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:43,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:41:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 17:41:43,504 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-02-20 17:41:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:43,504 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 17:41:43,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:41:43,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:43,505 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:43,522 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:41:43,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:43,722 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2022-02-20 17:41:43,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:43,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48998763] [2022-02-20 17:41:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:43,731 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:43,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10858980] [2022-02-20 17:41:43,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:43,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:43,747 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:41:43,748 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:41:43,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:43,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:43,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:41:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:43,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:44,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#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(9, 2);call #Ultimate.allocInit(12, 3); {730#true} is VALID [2022-02-20 17:41:44,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {730#true} is VALID [2022-02-20 17:41:44,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(0 == assume_abort_if_not_~cond#1); {730#true} is VALID [2022-02-20 17:41:44,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:44,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:44,191 INFO L272 TraceCheckUtils]: 5: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:41:44,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:44,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:44,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:44,192 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #46#return; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:44,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:44,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:44,193 INFO L272 TraceCheckUtils]: 12: Hoare triple {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:41:44,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} ~cond := #in~cond; {776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:44,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:44,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {780#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:44,195 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {780#(not (= |__VERIFIER_assert_#in~cond| 0))} {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:44,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(and (= (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) |ULTIMATE.start_main_~x~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {790#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) (= (+ (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:41:44,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) (= (+ (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) |ULTIMATE.start_main_~x~0#1|))} assume !false; {790#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) (= (+ (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:41:44,196 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) (= (+ (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {730#true} is VALID [2022-02-20 17:41:44,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {730#true} ~cond := #in~cond; {776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:44,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:44,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {780#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:44,198 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {780#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) (= (+ (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~y~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) |ULTIMATE.start_main_~x~0#1|))} #46#return; {809#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:44,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {809#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {813#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:44,199 INFO L272 TraceCheckUtils]: 25: Hoare triple {813#(and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:44,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:44,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:41:44,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:41:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:41:44,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:58,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:58,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48998763] [2022-02-20 17:41:58,894 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:58,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10858980] [2022-02-20 17:41:58,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10858980] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:58,895 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:58,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:41:58,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097428656] [2022-02-20 17:41:58,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:58,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:58,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:58,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:58,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:58,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:41:58,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:58,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:41:58,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:41:58,917 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:59,300 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-02-20 17:41:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:59,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-02-20 17:41:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-02-20 17:41:59,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-02-20 17:41:59,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:59,333 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:41:59,333 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:41:59,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:41:59,334 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:59,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 101 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:41:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 17:41:59,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:59,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:59,348 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:59,348 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:59,349 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 17:41:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 17:41:59,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:59,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:59,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 17:41:59,350 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 17:41:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:59,351 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 17:41:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 17:41:59,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:59,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:59,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:59,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-20 17:41:59,353 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2022-02-20 17:41:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:59,353 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-20 17:41:59,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 17:41:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:41:59,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:59,354 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:59,371 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:41:59,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:59,567 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2022-02-20 17:41:59,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:59,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742789027] [2022-02-20 17:41:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:59,588 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:59,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072826355] [2022-02-20 17:41:59,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:59,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:59,591 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:41:59,592 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:41:59,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:41:59,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:59,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:41:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:59,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:59,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#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(9, 2);call #Ultimate.allocInit(12, 3); {1042#true} is VALID [2022-02-20 17:41:59,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~k~0#1 >= 0 && main_~k~0#1 <= 2 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1050#(or (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~k~0#1| 2)) (and (or (not (<= 0 |ULTIMATE.start_main_~k~0#1|)) (not (<= |ULTIMATE.start_main_~k~0#1| 2))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:41:59,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {1050#(or (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~k~0#1| 2)) (and (or (not (<= 0 |ULTIMATE.start_main_~k~0#1|)) (not (<= |ULTIMATE.start_main_~k~0#1| 2))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {1054#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:41:59,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {1054#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,920 INFO L272 TraceCheckUtils]: 5: Hoare triple {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1042#true} is VALID [2022-02-20 17:41:59,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-02-20 17:41:59,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-02-20 17:41:59,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-02-20 17:41:59,921 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1042#true} {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} #46#return; {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {1058#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 0 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,922 INFO L272 TraceCheckUtils]: 12: Hoare triple {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1042#true} is VALID [2022-02-20 17:41:59,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-02-20 17:41:59,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-02-20 17:41:59,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-02-20 17:41:59,923 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1042#true} {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} #46#return; {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:59,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {1080#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2) (<= 1 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:41:59,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume !false; {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:41:59,925 INFO L272 TraceCheckUtils]: 19: Hoare triple {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1042#true} is VALID [2022-02-20 17:41:59,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-02-20 17:41:59,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-02-20 17:41:59,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-02-20 17:41:59,934 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1042#true} {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} #46#return; {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} is VALID [2022-02-20 17:41:59,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 2))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1043#false} is VALID [2022-02-20 17:41:59,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L272 TraceCheckUtils]: 26: Hoare triple {1043#false} call __VERIFIER_assert((if 0 == 4 * main_~x~0#1 - main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {1043#false} ~cond := #in~cond; {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !(0 == ~cond); {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {1043#false} assume true; {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1043#false} {1043#false} #46#return; {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {1043#false} assume !(main_~c~0#1 < main_~k~0#1); {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L272 TraceCheckUtils]: 32: Hoare triple {1043#false} call __VERIFIER_assert((if 0 == main_~k~0#1 * main_~y~0#1 - main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {1043#false} ~cond := #in~cond; {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {1043#false} assume 0 == ~cond; {1043#false} is VALID [2022-02-20 17:41:59,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-02-20 17:41:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:41:59,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:59,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:59,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742789027] [2022-02-20 17:41:59,936 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:59,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072826355] [2022-02-20 17:41:59,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072826355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:59,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:59,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 17:41:59,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39866335] [2022-02-20 17:41:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:59,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-02-20 17:41:59,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:59,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:59,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:59,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:59,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:59,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:41:59,958 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:00,111 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 17:42:00,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:42:00,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-02-20 17:42:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:42:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-02-20 17:42:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-02-20 17:42:00,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-02-20 17:42:00,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:42:00,139 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:42:00,139 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:42:00,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:42:00,140 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:42:00,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:42:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:42:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:42:00,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:42:00,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:42:00,141 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:42:00,141 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:42:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:00,141 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:42:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:42:00,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:00,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:00,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:42:00,141 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:42:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:42:00,141 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:42:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:42:00,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:00,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:42:00,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:42:00,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:42:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:42:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:42:00,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-02-20 17:42:00,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:42:00,142 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:42:00,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:42:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:42:00,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:42:00,144 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:42:00,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:42:00,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:42:00,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:42:00,585 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse2 (= (+ (* .cse3 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4)))) (or (and .cse0 (<= 2 |ULTIMATE.start_main_~c~0#1|) .cse1 (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|) (= .cse3 |ULTIMATE.start_main_~x~0#1|)) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) .cse2)))) [2022-02-20 17:42:00,586 INFO L854 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse0 (= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4)))) (or (and (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~k~0#1| 2) (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse0) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)))) [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L854 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse2 (= (+ (* .cse3 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4)))) (or (and .cse0 (<= 2 |ULTIMATE.start_main_~c~0#1|) .cse1 (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|) (= .cse3 |ULTIMATE.start_main_~x~0#1|)) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 (= |ULTIMATE.start_main_~y~0#1| 0) .cse2)))) [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L861 garLoopResultBuilder]: At program point L39(lines 17 40) the Hoare annotation is: true [2022-02-20 17:42:00,586 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:42:00,586 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~x~0#1| 4)) [2022-02-20 17:42:00,586 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-02-20 17:42:00,595 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-02-20 17:42:00,595 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-02-20 17:42:00,595 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:42:00,595 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:42:00,595 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 17:42:00,598 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-02-20 17:42:00,598 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:42:00,602 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:42:00,602 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:42:00,603 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:42:00,608 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:42:00,608 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:42:00,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:42:00 BoogieIcfgContainer [2022-02-20 17:42:00,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:42:00,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:42:00,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:42:00,619 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:42:00,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:16" (3/4) ... [2022-02-20 17:42:00,621 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:42:00,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:42:00,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:42:00,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:42:00,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:42:00,627 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:42:00,646 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:42:00,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:42:00,647 INFO L158 Benchmark]: Toolchain (without parser) took 44256.53ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 75.0MB in the beginning and 84.7MB in the end (delta: -9.7MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2022-02-20 17:42:00,647 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:42:00,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.50ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 96.5MB in the end (delta: -21.7MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-02-20 17:42:00,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.36ms. Allocated memory is still 117.4MB. Free memory was 96.5MB in the beginning and 95.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:42:00,648 INFO L158 Benchmark]: Boogie Preprocessor took 31.04ms. Allocated memory is still 117.4MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:42:00,648 INFO L158 Benchmark]: RCFGBuilder took 267.50ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 89.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 17:42:00,648 INFO L158 Benchmark]: TraceAbstraction took 43658.01ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 88.9MB in the beginning and 86.8MB in the end (delta: 2.0MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2022-02-20 17:42:00,648 INFO L158 Benchmark]: Witness Printer took 27.37ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 84.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:42:00,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.50ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 96.5MB in the end (delta: -21.7MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.36ms. Allocated memory is still 117.4MB. Free memory was 96.5MB in the beginning and 95.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.04ms. Allocated memory is still 117.4MB. Free memory was 95.2MB in the beginning and 94.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.50ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 89.3MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43658.01ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 88.9MB in the beginning and 86.8MB in the end (delta: 2.0MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Witness Printer took 27.37ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 84.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 93 mSDtfsCounter, 203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 18 PreInvPairs, 30 NumberOfFragments, 285 HoareAnnotationTreeSize, 18 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 111 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 40.4s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 638 SizeOfPredicates, 11 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 80/96 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((((cond == 1 && 2 <= c) && k <= 2) && 2 == y) && 1 < k) && c <= 2) && y * y * y * 2 + y * y * y * y + y * y == x * 4) || (((((cond == 1 && k <= 2) && c == 1) && y == 1) && 0 < k) && y * y * y == x)) || (((((0 <= k && cond == 1) && c == 0) && k <= 2) && y == 0) && y * y * y * 2 + y * y * y * y + y * y == x * 4) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:42:00,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE