./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.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_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:23,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:23,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:23,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:23,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:23,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:23,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:23,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:23,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:23,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:23,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:23,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:23,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:23,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:23,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:23,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:23,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:23,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:23,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:23,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:23,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:23,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:23,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:23,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:23,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:23,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:23,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:23,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:23,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:23,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:23,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:23,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:23,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:23,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:23,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:23,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:23,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:23,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:23,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:23,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:23,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:23,876 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:23,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:23,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:23,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:23,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:23,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:23,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:23,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:23,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:23,901 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:23,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:23,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:23,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:23,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:23,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:23,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:23,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:23,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:23,903 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:23,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:23,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:23,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:23,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:23,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:23,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:23,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:23,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:23,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:23,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:23,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:23,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:23,905 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:23,905 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:23,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:23,905 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 -> b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 [2022-02-20 17:41:24,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:24,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:24,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:24,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:24,122 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:24,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-02-20 17:41:24,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f96caadb4/a368bc806a594e8f8974fe4fbffd0a33/FLAG51b7e2332 [2022-02-20 17:41:24,535 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:24,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-02-20 17:41:24,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f96caadb4/a368bc806a594e8f8974fe4fbffd0a33/FLAG51b7e2332 [2022-02-20 17:41:24,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f96caadb4/a368bc806a594e8f8974fe4fbffd0a33 [2022-02-20 17:41:24,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:24,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:24,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:24,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:24,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:24,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:24" (1/1) ... [2022-02-20 17:41:24,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666601e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:24, skipping insertion in model container [2022-02-20 17:41:24,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:24" (1/1) ... [2022-02-20 17:41:24,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:24,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:24,735 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_valuebound5.c[458,471] [2022-02-20 17:41:24,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:24,768 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:24,777 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_valuebound5.c[458,471] [2022-02-20 17:41:24,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:24,803 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:24,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:24 WrapperNode [2022-02-20 17:41:24,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:24,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:24,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:24,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:24,810 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:24" (1/1) ... [2022-02-20 17:41:24,815 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:24" (1/1) ... [2022-02-20 17:41:24,835 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2022-02-20 17:41:24,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:24,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:24,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:24,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:24,842 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:24" (1/1) ... [2022-02-20 17:41:24,842 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:24" (1/1) ... [2022-02-20 17:41:24,848 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:24" (1/1) ... [2022-02-20 17:41:24,849 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:24" (1/1) ... [2022-02-20 17:41:24,858 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:24" (1/1) ... [2022-02-20 17:41:24,861 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:24" (1/1) ... [2022-02-20 17:41:24,862 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:24" (1/1) ... [2022-02-20 17:41:24,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:24,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:24,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:24,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:24,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:24" (1/1) ... [2022-02-20 17:41:24,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:24,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:24,893 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:24,894 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:24,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:24,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:24,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:24,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:24,957 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:24,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:25,109 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:25,114 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:25,114 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:25,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:25 BoogieIcfgContainer [2022-02-20 17:41:25,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:25,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:25,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:25,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:25,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:24" (1/3) ... [2022-02-20 17:41:25,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8af8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:25, skipping insertion in model container [2022-02-20 17:41:25,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:24" (2/3) ... [2022-02-20 17:41:25,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8af8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:25, skipping insertion in model container [2022-02-20 17:41:25,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:25" (3/3) ... [2022-02-20 17:41:25,121 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2022-02-20 17:41:25,129 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:25,143 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:25,198 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:25,203 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:25,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:25,228 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:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:25,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:25,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:25,232 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -589436290, now seen corresponding path program 1 times [2022-02-20 17:41:25,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:25,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832969174] [2022-02-20 17:41:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:25,390 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:25,391 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 <= 5 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:25,393 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:25,394 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:25,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#false} assume false; {23#false} is VALID [2022-02-20 17:41:25,394 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:25,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-02-20 17:41:25,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-02-20 17:41:25,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 17:41:25,396 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:25,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:25,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832969174] [2022-02-20 17:41:25,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832969174] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:25,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:25,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:25,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495891009] [2022-02-20 17:41:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:25,404 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:25,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:25,409 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:25,425 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:25,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:25,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:25,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:25,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:25,447 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:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:25,505 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-02-20 17:41:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:25,506 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:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:25,508 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:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:41:25,515 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:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-02-20 17:41:25,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2022-02-20 17:41:25,587 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:25,593 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:41:25,593 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:41:25,596 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:25,599 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:25,600 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:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:41:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:41:25,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:25,627 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:25,627 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:25,627 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:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:25,633 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:25,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:25,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:25,634 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:25,635 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:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:25,638 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:25,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:25,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:25,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:25,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:25,641 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:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:41:25,650 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-02-20 17:41:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:25,651 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:41:25,651 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:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:41:25,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:25,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:25,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:25,653 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:25,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1187358532, now seen corresponding path program 1 times [2022-02-20 17:41:25,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:25,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286861361] [2022-02-20 17:41:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:25,680 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:25,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151580888] [2022-02-20 17:41:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:25,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:25,686 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:25,687 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:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:25,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:25,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:25,864 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:25,865 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 <= 5 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:25,865 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:25,866 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:25,866 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:25,868 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:25,870 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:25,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {124#false} is VALID [2022-02-20 17:41:25,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 17:41:25,871 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:25,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:25,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:25,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286861361] [2022-02-20 17:41:25,872 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:25,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151580888] [2022-02-20 17:41:25,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151580888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:25,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:25,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:25,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436524748] [2022-02-20 17:41:25,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:25,877 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:25,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:25,877 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:25,885 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:25,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:25,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:25,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:25,887 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:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,220 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:41:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:26,221 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:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:26,221 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:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:41:26,223 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:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 17:41:26,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 17:41:26,253 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:26,255 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:41:26,256 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:41:26,256 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:26,259 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:26,260 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:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:41:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:41:26,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:26,268 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:26,268 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:26,269 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:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,271 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:26,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:26,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:26,272 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:26,272 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:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:26,275 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:26,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:26,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:26,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:26,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:26,276 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:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 17:41:26,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2022-02-20 17:41:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:26,278 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 17:41:26,278 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:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 17:41:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:26,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:26,279 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:26,297 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:26,483 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:26,484 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1781398469, now seen corresponding path program 1 times [2022-02-20 17:41:26,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:26,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331961840] [2022-02-20 17:41:26,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:26,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:26,497 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:26,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750263571] [2022-02-20 17:41:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:26,499 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:26,500 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:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:26,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:26,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:26,693 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:26,694 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 <= 5 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:26,694 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:26,694 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:26,695 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:26,695 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:26,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:41:26,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:41:26,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:41:26,697 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:26,697 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:26,698 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:26,699 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:26,699 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:26,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:41:26,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:41:26,700 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:26,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:26,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:41:26,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:41:26,945 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:26,946 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:26,946 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:27,012 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:27,013 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:27,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#true} assume true; {266#true} is VALID [2022-02-20 17:41:27,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#true} assume !(0 == ~cond); {266#true} is VALID [2022-02-20 17:41:27,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#true} ~cond := #in~cond; {266#true} is VALID [2022-02-20 17:41:27,013 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:27,016 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:27,017 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:27,017 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:27,017 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 <= 5 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:27,017 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:27,017 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:27,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:27,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331961840] [2022-02-20 17:41:27,018 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:27,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750263571] [2022-02-20 17:41:27,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750263571] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:27,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:27,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:27,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080365493] [2022-02-20 17:41:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:27,018 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:27,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:27,019 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:27,042 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:27,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:27,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:41:27,043 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:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:27,113 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 17:41:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:27,114 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:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:27,114 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:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:27,115 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:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:41:27,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:41:27,141 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:27,141 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:41:27,141 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:41:27,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:27,142 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:27,143 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:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:41:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:41:27,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:27,147 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:27,147 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:27,147 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:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:27,148 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 17:41:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:27,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:27,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:27,149 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:27,149 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:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:27,150 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 17:41:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:27,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:27,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:27,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:27,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:27,150 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:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-02-20 17:41:27,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2022-02-20 17:41:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:27,151 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-02-20 17:41:27,151 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:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 17:41:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:41:27,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:27,152 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:27,168 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:27,359 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:27,360 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1711372296, now seen corresponding path program 1 times [2022-02-20 17:41:27,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:27,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951655973] [2022-02-20 17:41:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:27,374 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:27,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710667726] [2022-02-20 17:41:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:27,375 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:27,377 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:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:27,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:27,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:27,622 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:27,622 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 <= 5 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:27,622 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:27,625 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:27,625 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:27,625 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:27,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-02-20 17:41:27,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-02-20 17:41:27,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume true; {481#true} is VALID [2022-02-20 17:41:27,627 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:27,628 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:27,628 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:27,628 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:27,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {481#true} ~cond := #in~cond; {481#true} is VALID [2022-02-20 17:41:27,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {481#true} assume !(0 == ~cond); {481#true} is VALID [2022-02-20 17:41:27,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {481#true} assume true; {481#true} is VALID [2022-02-20 17:41:27,629 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:27,630 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:27,630 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:27,631 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:27,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {482#false} is VALID [2022-02-20 17:41:27,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-02-20 17:41:27,632 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:27,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:27,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:27,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951655973] [2022-02-20 17:41:27,917 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:27,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710667726] [2022-02-20 17:41:27,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710667726] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:27,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:27,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-20 17:41:27,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548053744] [2022-02-20 17:41:27,917 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:27,917 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:27,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:27,918 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:27,933 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:27,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:41:27,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:27,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:41:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:27,934 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:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:28,070 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 17:41:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:41:28,070 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:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:28,071 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:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:41:28,072 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:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-02-20 17:41:28,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-02-20 17:41:28,099 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:28,100 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:41:28,100 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:41:28,101 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:28,101 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:28,101 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:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:41:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:41:28,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:28,109 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:28,110 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:28,110 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:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:28,111 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 17:41:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:28,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:28,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:28,112 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:28,112 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:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:28,113 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 17:41:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:28,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:28,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:28,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:28,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:28,114 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:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 17:41:28,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-02-20 17:41:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:28,115 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 17:41:28,115 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:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 17:41:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:41:28,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:28,116 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:28,133 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:28,327 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:28,328 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1075497887, now seen corresponding path program 2 times [2022-02-20 17:41:28,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:28,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026378501] [2022-02-20 17:41:28,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:28,337 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:28,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738901150] [2022-02-20 17:41:28,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:41:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:28,339 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:28,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:41:28,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:41:28,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:28,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:41:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:28,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:28,630 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:28,631 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 <= 5 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:28,631 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:28,631 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))} is VALID [2022-02-20 17:41:28,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:28,632 INFO L272 TraceCheckUtils]: 5: Hoare triple {744#(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)); {730#true} is VALID [2022-02-20 17:41:28,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:28,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:28,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:28,633 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {744#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:28,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(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; {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:28,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:28,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {766#(and (= (+ (- 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:28,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:28,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:28,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:28,635 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {730#true} {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {766#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:28,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(and (= (+ (- 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; {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:28,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !false; {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:28,636 INFO L272 TraceCheckUtils]: 19: Hoare triple {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~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)); {730#true} is VALID [2022-02-20 17:41:28,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:41:28,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:41:28,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:41:28,637 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {730#true} {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} #46#return; {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} is VALID [2022-02-20 17:41:28,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2))} assume !(main_~c~0#1 < main_~k~0#1); {810#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:28,638 INFO L272 TraceCheckUtils]: 25: Hoare triple {810#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 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)); {814#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:28,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:28,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:41:28,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:41:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:28,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:29,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:29,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026378501] [2022-02-20 17:41:29,097 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:29,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738901150] [2022-02-20 17:41:29,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738901150] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:29,097 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:29,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-20 17:41:29,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472460756] [2022-02-20 17:41:29,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:29,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:29,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:29,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:29,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:29,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:41:29,117 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,286 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-02-20 17:41:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:41:29,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 17:41:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-02-20 17:41:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-02-20 17:41:29,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-02-20 17:41:29,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:29,313 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:41:29,314 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:41:29,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:41:29,314 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:29,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:41:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:41:29,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:29,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 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:29,323 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 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:29,323 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 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:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,324 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:41:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:41:29,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:29,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:29,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:41:29,325 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:41:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:29,326 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:41:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:41:29,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:29,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:29,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:29,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 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:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 17:41:29,327 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-02-20 17:41:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:29,327 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 17:41:29,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:41:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:41:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:41:29,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:29,328 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:29,346 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:29,539 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:29,539 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash 817917912, now seen corresponding path program 3 times [2022-02-20 17:41:29,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:29,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988851710] [2022-02-20 17:41:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:29,550 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:29,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134662104] [2022-02-20 17:41:29,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:41:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:29,551 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:29,552 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:29,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 17:41:29,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:29,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 17:41:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:29,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:30,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {1017#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); {1017#true} is VALID [2022-02-20 17:41:30,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#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 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1017#true} is VALID [2022-02-20 17:41:30,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {1017#true} assume !(0 == assume_abort_if_not_~cond#1); {1017#true} is VALID [2022-02-20 17:41:30,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {1017#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,008 INFO L272 TraceCheckUtils]: 5: Hoare triple {1031#(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)); {1017#true} is VALID [2022-02-20 17:41:30,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {1017#true} ~cond := #in~cond; {1017#true} is VALID [2022-02-20 17:41:30,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#true} assume !(0 == ~cond); {1017#true} is VALID [2022-02-20 17:41:30,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#true} assume true; {1017#true} is VALID [2022-02-20 17:41:30,011 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1017#true} {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {1031#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:30,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {1031#(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; {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,012 INFO L272 TraceCheckUtils]: 12: Hoare triple {1053#(and (= (+ (- 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)); {1017#true} is VALID [2022-02-20 17:41:30,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {1017#true} ~cond := #in~cond; {1017#true} is VALID [2022-02-20 17:41:30,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {1017#true} assume !(0 == ~cond); {1017#true} is VALID [2022-02-20 17:41:30,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {1017#true} assume true; {1017#true} is VALID [2022-02-20 17:41:30,013 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1017#true} {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {1053#(and (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 0) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:30,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {1053#(and (= (+ (- 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; {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:30,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} assume !false; {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:30,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~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)); {1017#true} is VALID [2022-02-20 17:41:30,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#true} ~cond := #in~cond; {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:30,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:30,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:30,028 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} {1075#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} #46#return; {1096#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (* |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)) (= (+ (- 2) |ULTIMATE.start_main_~c~0#1|) 0))} is VALID [2022-02-20 17:41:30,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#(and (= (+ (- 2) |ULTIMATE.start_main_~y~0#1|) 0) (= (+ (* (* |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)) (= (+ (- 2) |ULTIMATE.start_main_~c~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; {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} is VALID [2022-02-20 17:41:30,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} assume !false; {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} is VALID [2022-02-20 17:41:30,031 INFO L272 TraceCheckUtils]: 26: Hoare triple {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~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)); {1017#true} is VALID [2022-02-20 17:41:30,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {1017#true} ~cond := #in~cond; {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:30,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {1085#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:30,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:30,032 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1089#(not (= |__VERIFIER_assert_#in~cond| 0))} {1100#(and (= (+ (- 3) |ULTIMATE.start_main_~y~0#1|) 0) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3) (= (+ (* |ULTIMATE.start_main_~x~0#1| 4) (* (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4)) (+ (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (* (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) 2) (* (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|) (+ (- 1) |ULTIMATE.start_main_~y~0#1|)))))} #46#return; {1119#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} is VALID [2022-02-20 17:41:30,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {1119#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (< 2 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 3))} assume !(main_~c~0#1 < main_~k~0#1); {1123#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:30,033 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |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)); {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:30,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:30,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {1131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1018#false} is VALID [2022-02-20 17:41:30,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {1018#false} assume !false; {1018#false} is VALID [2022-02-20 17:41:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:30,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:48,938 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 1) |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* (- 1) |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 4) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse0) (* .cse0 .cse0))) (not (< |c_ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (< (+ |c_ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~k~0#1|)))) is different from false [2022-02-20 17:41:48,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:48,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988851710] [2022-02-20 17:41:48,940 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:48,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134662104] [2022-02-20 17:41:48,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134662104] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:48,941 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:48,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 17:41:48,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663916365] [2022-02-20 17:41:48,941 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:48,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:48,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:48,981 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:48,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:41:48,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:41:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2022-02-20 17:41:48,981 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:49,396 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-02-20 17:41:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:41:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 17:41:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 17:41:49,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-02-20 17:41:49,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:49,431 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:41:49,431 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:41:49,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2022-02-20 17:41:49,432 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:49,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:41:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 17:41:49,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:49,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:49,444 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:49,444 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:49,445 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 17:41:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 17:41:49,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:49,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:49,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-02-20 17:41:49,447 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-02-20 17:41:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:49,450 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 17:41:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 17:41:49,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:49,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:49,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:49,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-02-20 17:41:49,454 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 36 [2022-02-20 17:41:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:49,455 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-02-20 17:41:49,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 10 states have internal predecessors, (21), 5 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:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 17:41:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:41:49,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:49,457 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:49,476 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:41:49,674 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:41:49,674 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1384689793, now seen corresponding path program 4 times [2022-02-20 17:41:49,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:49,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872216276] [2022-02-20 17:41:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:49,687 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:49,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494022732] [2022-02-20 17:41:49,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:41:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:49,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:49,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:41:49,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:41:49,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:49,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:41:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:49,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:50,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {1369#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); {1369#true} is VALID [2022-02-20 17:41:50,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1369#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 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1369#true} is VALID [2022-02-20 17:41:50,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {1369#true} assume !(0 == assume_abort_if_not_~cond#1); {1369#true} is VALID [2022-02-20 17:41:50,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {1369#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:50,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:50,082 INFO L272 TraceCheckUtils]: 5: Hoare triple {1383#(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)); {1369#true} is VALID [2022-02-20 17:41:50,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:50,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:50,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:50,082 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1369#true} {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {1383#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:50,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {1383#(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; {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:50,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:50,083 INFO L272 TraceCheckUtils]: 12: Hoare triple {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 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)); {1369#true} is VALID [2022-02-20 17:41:50,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:50,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:50,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:50,084 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1369#true} {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:50,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1405#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 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; {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:50,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} assume !false; {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:50,085 INFO L272 TraceCheckUtils]: 19: Hoare triple {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 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)); {1369#true} is VALID [2022-02-20 17:41:50,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:50,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:50,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:50,086 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1369#true} {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} #46#return; {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 1))} is VALID [2022-02-20 17:41:50,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {1427#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 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; {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:50,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:50,086 INFO L272 TraceCheckUtils]: 26: Hoare triple {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |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)); {1369#true} is VALID [2022-02-20 17:41:50,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:50,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:50,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:50,087 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1369#true} {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} #46#return; {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:50,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {1449#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= 3 |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; {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:50,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !false; {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:50,088 INFO L272 TraceCheckUtils]: 33: Hoare triple {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |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)); {1369#true} is VALID [2022-02-20 17:41:50,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {1369#true} ~cond := #in~cond; {1369#true} is VALID [2022-02-20 17:41:50,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {1369#true} assume !(0 == ~cond); {1369#true} is VALID [2022-02-20 17:41:50,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {1369#true} assume true; {1369#true} is VALID [2022-02-20 17:41:50,089 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1369#true} {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} #46#return; {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:50,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {1471#(and (<= |ULTIMATE.start_main_~c~0#1| 4) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (< 3 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {1493#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:41:50,090 INFO L272 TraceCheckUtils]: 39: Hoare triple {1493#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |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)); {1497#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:50,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {1497#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1501#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:50,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {1501#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1370#false} is VALID [2022-02-20 17:41:50,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {1370#false} assume !false; {1370#false} is VALID [2022-02-20 17:41:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:41:50,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:50,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:50,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872216276] [2022-02-20 17:41:50,432 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:50,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494022732] [2022-02-20 17:41:50,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494022732] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:50,432 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:50,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:41:50,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79562147] [2022-02-20 17:41:50,432 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:50,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2022-02-20 17:41:50,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:50,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:50,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:50,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:41:50,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:41:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:41:50,454 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:50,746 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-02-20 17:41:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 43 [2022-02-20 17:41:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-20 17:41:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-20 17:41:50,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-02-20 17:41:50,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:50,777 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:41:50,777 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:41:50,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:41:50,778 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:50,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:41:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:41:50,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:50,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:50,791 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:50,791 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:50,792 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 17:41:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 17:41:50,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:50,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:50,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 17:41:50,793 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 39 states. [2022-02-20 17:41:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:50,793 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 17:41:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 17:41:50,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:50,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:50,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:50,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-02-20 17:41:50,795 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 43 [2022-02-20 17:41:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:50,796 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-02-20 17:41:50,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:41:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 17:41:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 17:41:50,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:50,796 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:50,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 17:41:50,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:50,997 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -23130184, now seen corresponding path program 5 times [2022-02-20 17:41:50,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:50,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665746203] [2022-02-20 17:41:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:51,010 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:51,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083286363] [2022-02-20 17:41:51,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:41:51,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:51,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:51,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:51,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:41:51,072 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 17:41:51,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:51,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 17:41:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:51,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:51,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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); {1750#true} is VALID [2022-02-20 17:41:51,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#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 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1750#true} is VALID [2022-02-20 17:41:51,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} assume !(0 == assume_abort_if_not_~cond#1); {1750#true} is VALID [2022-02-20 17:41:51,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:51,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:51,453 INFO L272 TraceCheckUtils]: 5: Hoare triple {1764#(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)); {1750#true} is VALID [2022-02-20 17:41:51,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:51,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:51,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:51,454 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1750#true} {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} #46#return; {1764#(and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:41:51,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {1764#(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; {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:51,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} assume !false; {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:51,455 INFO L272 TraceCheckUtils]: 12: Hoare triple {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 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)); {1750#true} is VALID [2022-02-20 17:41:51,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:51,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:51,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:51,456 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1750#true} {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} #46#return; {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 0))} is VALID [2022-02-20 17:41:51,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {1786#(and (= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 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; {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:51,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:51,457 INFO L272 TraceCheckUtils]: 19: Hoare triple {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |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)); {1750#true} is VALID [2022-02-20 17:41:51,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:51,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:51,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:51,461 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1750#true} {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} #46#return; {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:51,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {1808#(and (= 2 |ULTIMATE.start_main_~y~0#1|) (= 2 |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; {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:51,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} assume !false; {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:51,462 INFO L272 TraceCheckUtils]: 26: Hoare triple {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~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)); {1750#true} is VALID [2022-02-20 17:41:51,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:51,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:51,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:51,463 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1750#true} {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} #46#return; {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~0#1|) 2))} is VALID [2022-02-20 17:41:51,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {1830#(and (= 3 |ULTIMATE.start_main_~y~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~c~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; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:51,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} assume !false; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:51,464 INFO L272 TraceCheckUtils]: 33: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |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)); {1750#true} is VALID [2022-02-20 17:41:51,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:51,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:51,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:51,464 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1750#true} {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} #46#return; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |ULTIMATE.start_main_~c~0#1|)))} is VALID [2022-02-20 17:41:51,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 3) (= 2 (+ (- 2) |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; {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:51,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !false; {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:51,465 INFO L272 TraceCheckUtils]: 40: Hoare triple {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~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)); {1750#true} is VALID [2022-02-20 17:41:51,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 17:41:51,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {1750#true} assume !(0 == ~cond); {1750#true} is VALID [2022-02-20 17:41:51,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 17:41:51,466 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1750#true} {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} #46#return; {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:51,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {1874#(and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} assume !(main_~c~0#1 < main_~k~0#1); {1896#(and (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:51,468 INFO L272 TraceCheckUtils]: 46: Hoare triple {1896#(and (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (= 3 (+ (- 2) |ULTIMATE.start_main_~y~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)); {1900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:51,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {1900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:51,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {1904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1751#false} is VALID [2022-02-20 17:41:51,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 17:41:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:41:51,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:51,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:51,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665746203] [2022-02-20 17:41:51,723 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:51,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083286363] [2022-02-20 17:41:51,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083286363] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:51,723 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:51,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 17:41:51,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520946940] [2022-02-20 17:41:51,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-02-20 17:41:51,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:51,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:51,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:51,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:41:51,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:41:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:41:51,749 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:52,122 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-20 17:41:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:41:52,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-02-20 17:41:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-02-20 17:41:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-02-20 17:41:52,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2022-02-20 17:41:52,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:52,165 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:41:52,165 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:41:52,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:41:52,166 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:52,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 217 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:41:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:41:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 17:41:52,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:52,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:52,188 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:52,190 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:52,191 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 17:41:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:41:52,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:52,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:52,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-02-20 17:41:52,192 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-02-20 17:41:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:52,194 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-20 17:41:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:41:52,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:52,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:52,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:52,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-02-20 17:41:52,196 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 50 [2022-02-20 17:41:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:52,196 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-02-20 17:41:52,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:41:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-02-20 17:41:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 17:41:52,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:52,197 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:52,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:52,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:52,410 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1898941279, now seen corresponding path program 6 times [2022-02-20 17:41:52,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:52,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746073681] [2022-02-20 17:41:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:52,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:52,419 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:52,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154101853] [2022-02-20 17:41:52,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:41:52,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:52,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:52,442 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:52,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:41:52,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 17:41:52,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:41:52,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:41:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:52,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:52,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {2169#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); {2169#true} is VALID [2022-02-20 17:41:52,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {2169#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 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2177#(or (and (or (not (<= |ULTIMATE.start_main_~k~0#1| 5)) (not (<= 0 |ULTIMATE.start_main_~k~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~k~0#1| 5)))} is VALID [2022-02-20 17:41:52,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {2177#(or (and (or (not (<= |ULTIMATE.start_main_~k~0#1| 5)) (not (<= 0 |ULTIMATE.start_main_~k~0#1|))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= |ULTIMATE.start_main_~k~0#1| 5)))} assume !(0 == assume_abort_if_not_~cond#1); {2181#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {2181#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} assume { :end_inline_assume_abort_if_not } true;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} assume !false; {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,922 INFO L272 TraceCheckUtils]: 5: Hoare triple {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} 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)); {2169#true} is VALID [2022-02-20 17:41:52,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:41:52,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:41:52,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:41:52,930 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2169#true} {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} #46#return; {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 0 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} 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; {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} assume !false; {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,935 INFO L272 TraceCheckUtils]: 12: Hoare triple {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} 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)); {2169#true} is VALID [2022-02-20 17:41:52,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:41:52,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:41:52,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:41:52,937 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2169#true} {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} #46#return; {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {2207#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} 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; {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} assume !false; {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,939 INFO L272 TraceCheckUtils]: 19: Hoare triple {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} 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)); {2169#true} is VALID [2022-02-20 17:41:52,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:41:52,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:41:52,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:41:52,940 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2169#true} {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} #46#return; {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} is VALID [2022-02-20 17:41:52,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= 2 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5))} 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; {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,944 INFO L272 TraceCheckUtils]: 26: Hoare triple {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |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)); {2169#true} is VALID [2022-02-20 17:41:52,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:41:52,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:41:52,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:41:52,944 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2169#true} {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |ULTIMATE.start_main_~c~0#1|))} #46#return; {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {2251#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 3 |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; {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,950 INFO L272 TraceCheckUtils]: 33: Hoare triple {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |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)); {2169#true} is VALID [2022-02-20 17:41:52,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:41:52,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:41:52,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:41:52,950 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2169#true} {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |ULTIMATE.start_main_~c~0#1|))} #46#return; {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {2273#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 4 |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; {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |ULTIMATE.start_main_~c~0#1|))} assume !false; {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,951 INFO L272 TraceCheckUtils]: 40: Hoare triple {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |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)); {2169#true} is VALID [2022-02-20 17:41:52,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {2169#true} ~cond := #in~cond; {2169#true} is VALID [2022-02-20 17:41:52,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {2169#true} assume !(0 == ~cond); {2169#true} is VALID [2022-02-20 17:41:52,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {2169#true} assume true; {2169#true} is VALID [2022-02-20 17:41:52,952 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2169#true} {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |ULTIMATE.start_main_~c~0#1|))} #46#return; {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {2295#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (<= 5 |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; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {2170#false} assume !false; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L272 TraceCheckUtils]: 47: Hoare triple {2170#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)); {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {2170#false} ~cond := #in~cond; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {2170#false} assume !(0 == ~cond); {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {2170#false} assume true; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2170#false} {2170#false} #46#return; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 52: Hoare triple {2170#false} assume !(main_~c~0#1 < main_~k~0#1); {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L272 TraceCheckUtils]: 53: Hoare triple {2170#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)); {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {2170#false} ~cond := #in~cond; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {2170#false} assume 0 == ~cond; {2170#false} is VALID [2022-02-20 17:41:52,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {2170#false} assume !false; {2170#false} is VALID [2022-02-20 17:41:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-02-20 17:41:52,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:52,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:52,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746073681] [2022-02-20 17:41:52,954 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:52,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154101853] [2022-02-20 17:41:52,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154101853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:52,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:52,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 17:41:52,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580350520] [2022-02-20 17:41:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:52,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 57 [2022-02-20 17:41:52,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:52,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:52,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:52,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:41:52,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:52,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:41:52,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:41:52,987 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:53,260 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-20 17:41:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 57 [2022-02-20 17:41:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 17:41:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-02-20 17:41:53,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-02-20 17:41:53,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:53,303 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:41:53,303 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:41:53,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:53,304 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:53,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:41:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:41:53,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:53,304 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:41:53,304 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:41:53,304 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:41:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:53,305 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:41:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:41:53,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:53,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:53,305 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:41:53,305 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:41:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:53,305 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:41:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:41:53,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:53,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:53,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:53,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:53,305 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:41:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:41:53,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2022-02-20 17:41:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:53,305 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:41:53,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 7 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:41:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:41:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:53,307 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:41:53,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:53,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 17:41:53,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:41:53,860 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse2 (= (+ (* (* |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 .cse0 (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|) .cse1 (= |ULTIMATE.start_main_~c~0#1| 4) .cse2) (and .cse0 (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) .cse1 (= 2 |ULTIMATE.start_main_~c~0#1|) .cse2) (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 1) .cse1 (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse2) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) .cse1 (<= 5 |ULTIMATE.start_main_~c~0#1|) .cse2) (and .cse0 (= 3 |ULTIMATE.start_main_~y~0#1|) .cse1 (< 2 |ULTIMATE.start_main_~k~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|) .cse2))) [2022-02-20 17:41:53,860 INFO L854 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse2 (+ (- 2) |ULTIMATE.start_main_~y~0#1|)) (.cse0 (+ (- 1) |ULTIMATE.start_main_~y~0#1|)) (.cse1 (= (+ (* (* |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) (= .cse0 0) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse1) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)) (and (= .cse2 0) (<= |ULTIMATE.start_main_~k~0#1| 2) (< 1 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 2) .cse1) (and (<= |ULTIMATE.start_main_~c~0#1| 5) (< 4 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 5) (= 3 .cse2) .cse1) (and (= 3 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 3) (< 2 |ULTIMATE.start_main_~k~0#1|) .cse1 (<= |ULTIMATE.start_main_~c~0#1| 3)) (and (<= |ULTIMATE.start_main_~c~0#1| 4) (= .cse0 3) (<= |ULTIMATE.start_main_~k~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|) .cse1))) [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:41:53,860 INFO L854 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse2 (= (+ (* (* |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 .cse0 (= |ULTIMATE.start_main_~y~0#1| 4) (< 3 |ULTIMATE.start_main_~k~0#1|) .cse1 (= |ULTIMATE.start_main_~c~0#1| 4) .cse2) (and .cse0 (= 2 |ULTIMATE.start_main_~y~0#1|) (< 1 |ULTIMATE.start_main_~k~0#1|) .cse1 (= 2 |ULTIMATE.start_main_~c~0#1|) .cse2) (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 1) .cse1 (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|) .cse2) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) .cse1 .cse2) (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| 5) (= 5 |ULTIMATE.start_main_~y~0#1|) (< 4 |ULTIMATE.start_main_~k~0#1|) .cse1 (<= 5 |ULTIMATE.start_main_~c~0#1|) .cse2) (and .cse0 (= 3 |ULTIMATE.start_main_~y~0#1|) .cse1 (< 2 |ULTIMATE.start_main_~k~0#1|) (= 3 |ULTIMATE.start_main_~c~0#1|) .cse2))) [2022-02-20 17:41:53,860 INFO L858 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-02-20 17:41:53,861 INFO L861 garLoopResultBuilder]: At program point L39(lines 17 40) the Hoare annotation is: true [2022-02-20 17:41:53,861 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:41:53,861 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:41:53,861 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-02-20 17:41:53,861 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-02-20 17:41:53,861 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-02-20 17:41:53,861 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:41:53,861 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:41:53,861 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 17:41:53,863 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-02-20 17:41:53,864 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:41:53,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:41:53,874 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:41:53,875 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:41:53,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:41:53 BoogieIcfgContainer [2022-02-20 17:41:53,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:41:53,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:41:53,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:41:53,888 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:41:53,888 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:25" (3/4) ... [2022-02-20 17:41:53,890 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:41:53,893 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:41:53,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 17:41:53,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:41:53,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:41:53,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:41:53,913 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:41:53,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:41:53,914 INFO L158 Benchmark]: Toolchain (without parser) took 29354.14ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 95.2MB in the beginning and 76.3MB in the end (delta: 18.9MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2022-02-20 17:41:53,914 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 45.5MB in the beginning and 45.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:41:53,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.55ms. Allocated memory is still 127.9MB. Free memory was 94.9MB in the beginning and 102.6MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:41:53,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 127.9MB. Free memory was 102.6MB in the beginning and 101.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:41:53,915 INFO L158 Benchmark]: Boogie Preprocessor took 30.33ms. Allocated memory is still 127.9MB. Free memory was 101.0MB in the beginning and 100.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:41:53,915 INFO L158 Benchmark]: RCFGBuilder took 248.58ms. Allocated memory is still 127.9MB. Free memory was 100.0MB in the beginning and 90.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:41:53,915 INFO L158 Benchmark]: TraceAbstraction took 28771.04ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 89.5MB in the beginning and 78.4MB in the end (delta: 11.2MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2022-02-20 17:41:53,915 INFO L158 Benchmark]: Witness Printer took 25.58ms. Allocated memory is still 157.3MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:41:53,916 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.16ms. Allocated memory is still 90.2MB. Free memory was 45.5MB in the beginning and 45.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.55ms. Allocated memory is still 127.9MB. Free memory was 94.9MB in the beginning and 102.6MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 127.9MB. Free memory was 102.6MB in the beginning and 101.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.33ms. Allocated memory is still 127.9MB. Free memory was 101.0MB in the beginning and 100.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 248.58ms. Allocated memory is still 127.9MB. Free memory was 100.0MB in the beginning and 90.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28771.04ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 89.5MB in the beginning and 78.4MB in the end (delta: 11.2MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 25.58ms. Allocated memory is still 157.3MB. Free memory was 78.4MB in the beginning and 76.3MB 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: 28.7s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 181 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 256 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 24 PreInvPairs, 45 NumberOfFragments, 625 HoareAnnotationTreeSize, 24 FomulaSimplifications, 250 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 23.1s InterpolantComputationTime, 271 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 1327 SizeOfPredicates, 17 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 345/454 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 && y == 4) && 3 < k) && k <= 5) && c == 4) && y * y * y * 2 + y * y * y * y + y * y == x * 4) || (((((cond == 1 && 2 == y) && 1 < k) && k <= 5) && 2 == c) && y * y * y * 2 + y * y * y * y + y * y == x * 4)) || (((((cond == 1 && c == 1) && k <= 5) && y == 1) && 0 < k) && y * y * y * 2 + y * y * y * y + y * y == x * 4)) || (((((0 <= k && cond == 1) && c == 0) && y == 0) && k <= 5) && y * y * y * 2 + y * y * y * y + y * y == x * 4)) || ((((((cond == 1 && c <= 5) && 5 == y) && 4 < k) && k <= 5) && 5 <= c) && y * y * y * 2 + y * y * y * y + y * y == x * 4)) || (((((cond == 1 && 3 == y) && k <= 5) && 2 < k) && 3 == c) && 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:41:53,936 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