./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.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/ps6-ll_valuebound1.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 87608ec580cc80a59c7836f9aeadd0fc773dea5ebb620dd020651936daa4e397 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:43:39,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:43:39,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:43:39,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:43:39,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:43:39,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:43:39,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:43:39,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:43:39,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:43:39,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:43:39,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:43:39,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:43:39,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:43:39,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:43:39,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:43:39,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:43:39,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:43:39,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:43:39,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:43:39,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:43:39,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:43:39,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:43:39,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:43:39,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:43:39,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:43:39,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:43:39,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:43:39,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:43:39,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:43:39,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:43:39,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:43:39,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:43:39,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:43:39,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:43:39,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:43:39,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:43:39,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:43:39,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:43:39,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:43:39,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:43:39,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:43:39,385 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:43:39,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:43:39,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:43:39,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:43:39,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:43:39,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:43:39,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:43:39,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:43:39,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:43:39,413 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:43:39,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:43:39,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:43:39,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:43:39,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:43:39,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:43:39,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:43:39,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:43:39,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:43:39,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:43:39,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:43:39,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:43:39,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:43:39,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:43:39,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:43:39,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:43:39,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:39,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:43:39,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:43:39,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:43:39,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:43:39,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:43:39,418 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:43:39,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:43:39,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:43:39,418 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 -> 87608ec580cc80a59c7836f9aeadd0fc773dea5ebb620dd020651936daa4e397 [2022-02-20 17:43:39,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:43:39,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:43:39,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:43:39,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:43:39,699 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:43:39,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c [2022-02-20 17:43:39,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84faf1c9/78e26265401e45dabd97e5030039fbbb/FLAGfbc79fd59 [2022-02-20 17:43:40,158 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:43:40,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c [2022-02-20 17:43:40,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84faf1c9/78e26265401e45dabd97e5030039fbbb/FLAGfbc79fd59 [2022-02-20 17:43:40,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84faf1c9/78e26265401e45dabd97e5030039fbbb [2022-02-20 17:43:40,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:43:40,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:43:40,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:40,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:43:40,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:43:40,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f62b565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40, skipping insertion in model container [2022-02-20 17:43:40,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:43:40,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:43:40,700 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/ps6-ll_valuebound1.c[458,471] [2022-02-20 17:43:40,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:40,728 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:43:40,758 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/ps6-ll_valuebound1.c[458,471] [2022-02-20 17:43:40,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:43:40,799 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:43:40,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40 WrapperNode [2022-02-20 17:43:40,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:43:40,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:40,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:43:40,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:43:40,807 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:43:40" (1/1) ... [2022-02-20 17:43:40,813 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:43:40" (1/1) ... [2022-02-20 17:43:40,835 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 17:43:40,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:43:40,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:43:40,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:43:40,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:43:40,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:43:40,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:43:40,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:43:40,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:43:40,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (1/1) ... [2022-02-20 17:43:40,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:43:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:40,908 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:43:40,910 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:43:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:43:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:43:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:43:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:43:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:43:40,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:43:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:43:40,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:43:40,982 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:43:40,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:43:41,178 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:43:41,184 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:43:41,185 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:43:41,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:41 BoogieIcfgContainer [2022-02-20 17:43:41,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:43:41,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:43:41,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:43:41,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:43:41,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:43:40" (1/3) ... [2022-02-20 17:43:41,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7363fb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:41, skipping insertion in model container [2022-02-20 17:43:41,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:43:40" (2/3) ... [2022-02-20 17:43:41,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7363fb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:43:41, skipping insertion in model container [2022-02-20 17:43:41,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:41" (3/3) ... [2022-02-20 17:43:41,195 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound1.c [2022-02-20 17:43:41,199 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:43:41,199 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:43:41,233 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:43:41,239 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:43:41,239 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:43:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:43:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:41,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:41,260 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:41,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2022-02-20 17:43:41,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:41,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270057740] [2022-02-20 17:43:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:43:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:41,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:41,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:41,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:43:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:43:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:41,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:41,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:41,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:43:41,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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); {27#true} is VALID [2022-02-20 17:43:41,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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; {27#true} is VALID [2022-02-20 17:43:41,451 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {27#true} is VALID [2022-02-20 17:43:41,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:41,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:41,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:41,453 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:43:41,453 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#false} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {27#true} is VALID [2022-02-20 17:43:41,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:43:41,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:43:41,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:43:41,455 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:43:41,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {28#false} is VALID [2022-02-20 17:43:41,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 17:43:41,456 INFO L272 TraceCheckUtils]: 14: Hoare triple {28#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {28#false} is VALID [2022-02-20 17:43:41,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-02-20 17:43:41,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:43:41,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:43:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:41,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:41,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270057740] [2022-02-20 17:43:41,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270057740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:41,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:41,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:43:41,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444850217] [2022-02-20 17:43:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:41,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:41,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:41,510 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:43:41,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:43:41,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:43:41,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:41,539 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:41,632 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-02-20 17:43:41,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:43:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:43:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:43:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:43:41,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:43:41,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:41,765 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:43:41,765 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 17:43:41,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:43:41,771 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:41,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 17:43:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 17:43:41,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:41,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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:43:41,793 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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:43:41,794 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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:43:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:41,797 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:43:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:41,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:41,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:41,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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) Second operand 20 states. [2022-02-20 17:43:41,799 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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) Second operand 20 states. [2022-02-20 17:43:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:41,802 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:43:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:41,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:41,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:41,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:41,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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:43:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 17:43:41,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2022-02-20 17:43:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:41,807 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 17:43:41,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:43:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:43:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:43:41,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:41,808 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:41,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:43:41,809 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2022-02-20 17:43:41,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:41,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899390207] [2022-02-20 17:43:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:41,826 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:41,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119229763] [2022-02-20 17:43:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:41,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:41,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:41,831 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:43:41,846 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:43:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:43:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:41,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:42,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#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); {169#true} is VALID [2022-02-20 17:43:42,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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; {169#true} is VALID [2022-02-20 17:43:42,060 INFO L272 TraceCheckUtils]: 2: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {169#true} is VALID [2022-02-20 17:43:42,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:43:42,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:43:42,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:43:42,061 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {169#true} {169#true} #50#return; {169#true} is VALID [2022-02-20 17:43:42,061 INFO L272 TraceCheckUtils]: 7: Hoare triple {169#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {169#true} is VALID [2022-02-20 17:43:42,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {169#true} ~cond := #in~cond; {169#true} is VALID [2022-02-20 17:43:42,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#true} assume !(0 == ~cond); {169#true} is VALID [2022-02-20 17:43:42,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#true} assume true; {169#true} is VALID [2022-02-20 17:43:42,062 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {169#true} {169#true} #52#return; {169#true} is VALID [2022-02-20 17:43:42,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {169#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:42,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:42,065 INFO L272 TraceCheckUtils]: 14: Hoare triple {210#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:42,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:42,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {170#false} is VALID [2022-02-20 17:43:42,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#false} assume !false; {170#false} is VALID [2022-02-20 17:43:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:42,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:43:42,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:42,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899390207] [2022-02-20 17:43:42,067 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:42,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119229763] [2022-02-20 17:43:42,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119229763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:43:42,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:43:42,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:43:42,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872272121] [2022-02-20 17:43:42,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:43:42,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:42,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:42,100 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:43:42,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:42,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:42,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:42,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:43:42,102 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:54,218 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:43:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:43:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:43:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:43:54,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:43:54,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:54,279 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:43:54,279 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:43:54,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:43:54,281 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 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:43:54,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:43:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:43:54,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:54,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 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:43:54,288 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 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:43:54,289 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 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:43:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:54,291 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:43:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:54,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:54,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:54,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 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 27 states. [2022-02-20 17:43:54,293 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 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 27 states. [2022-02-20 17:43:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:54,296 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 17:43:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:54,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:54,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:54,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:54,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 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:43:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-20 17:43:54,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-02-20 17:43:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:54,300 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-20 17:43:54,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:43:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 17:43:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:43:54,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:54,302 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:54,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:43:54,515 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:43:54,516 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2022-02-20 17:43:54,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:54,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502056458] [2022-02-20 17:43:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:54,531 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:54,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127875162] [2022-02-20 17:43:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:54,534 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:43:54,536 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:43:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:54,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:43:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:54,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:54,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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); {365#true} is VALID [2022-02-20 17:43:54,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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; {365#true} is VALID [2022-02-20 17:43:54,804 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:54,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:54,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:54,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:54,807 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:43:54,808 INFO L272 TraceCheckUtils]: 7: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:54,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:54,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:54,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:54,810 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:43:54,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:54,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !false; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:54,813 INFO L272 TraceCheckUtils]: 14: Hoare triple {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:54,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:54,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:54,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:54,815 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #54#return; {406#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:43:54,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {406#(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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:54,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} assume !false; {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:43:54,818 INFO L272 TraceCheckUtils]: 21: Hoare triple {428#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ |ULTIMATE.start_main_~x~0#1| (* (- 1) |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:54,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:54,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:43:54,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:43:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:43:54,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:43:55,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:43:55,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:43:55,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {435#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {439#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:55,128 INFO L272 TraceCheckUtils]: 21: Hoare triple {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {435#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:55,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:55,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:55,257 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {365#true} {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} #54#return; {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:55,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:55,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:55,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:55,257 INFO L272 TraceCheckUtils]: 14: Hoare triple {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:55,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:55,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {455#(= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:43:55,259 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {365#true} {365#true} #52#return; {365#true} is VALID [2022-02-20 17:43:55,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:55,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:55,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:55,260 INFO L272 TraceCheckUtils]: 7: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:55,260 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {365#true} {365#true} #50#return; {365#true} is VALID [2022-02-20 17:43:55,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:43:55,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:43:55,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:43:55,260 INFO L272 TraceCheckUtils]: 2: Hoare triple {365#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:43:55,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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; {365#true} is VALID [2022-02-20 17:43:55,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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); {365#true} is VALID [2022-02-20 17:43:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:43:55,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:43:55,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502056458] [2022-02-20 17:43:55,261 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:43:55,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127875162] [2022-02-20 17:43:55,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127875162] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:43:55,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:43:55,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:43:55,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321732636] [2022-02-20 17:43:55,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:43:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:43:55,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:43:55,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:55,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:43:55,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:43:55,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:43:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:43:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:43:55,404 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,523 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-02-20 17:43:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:43:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 17:43:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:43:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:43:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:43:55,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:43:55,715 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:43:55,717 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:43:55,717 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:43:55,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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:43:55,718 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:43:55,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:43:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:43:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:43:55,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:43:55,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:43:55,726 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:43:55,726 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:43:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,728 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:43:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:43:55,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:55,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:55,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 29 states. [2022-02-20 17:43:55,730 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 29 states. [2022-02-20 17:43:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:43:55,732 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-20 17:43:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:43:55,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:43:55,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:43:55,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:43:55,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:43:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:43:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-20 17:43:55,735 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-02-20 17:43:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:43:55,735 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-20 17:43:55,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:43:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-20 17:43:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:43:55,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:43:55,737 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:43:55,762 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:43:55,962 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:43:55,962 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:43:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:43:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2022-02-20 17:43:55,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:43:55,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112252746] [2022-02-20 17:43:55,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:43:55,977 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:43:55,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613425773] [2022-02-20 17:43:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:43:55,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:43:55,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:43:55,980 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:43:55,991 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:43:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:56,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 17:43:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:43:56,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:43:56,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {664#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); {664#true} is VALID [2022-02-20 17:43:56,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#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; {664#true} is VALID [2022-02-20 17:43:56,539 INFO L272 TraceCheckUtils]: 2: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:56,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:56,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:56,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:56,540 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {664#true} {664#true} #50#return; {664#true} is VALID [2022-02-20 17:43:56,541 INFO L272 TraceCheckUtils]: 7: Hoare triple {664#true} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:56,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:56,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:56,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:56,541 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {664#true} {664#true} #52#return; {664#true} is VALID [2022-02-20 17:43:56,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#true} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:56,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} assume !false; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:56,544 INFO L272 TraceCheckUtils]: 14: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:56,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:56,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:56,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:56,546 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {664#true} {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} #54#return; {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0))} is VALID [2022-02-20 17:43:56,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {705#(and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 0 |ULTIMATE.start_main_~x~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !false; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,547 INFO L272 TraceCheckUtils]: 21: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:56,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#true} ~cond := #in~cond; {664#true} is VALID [2022-02-20 17:43:56,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#true} assume !(0 == ~cond); {664#true} is VALID [2022-02-20 17:43:56,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {664#true} assume true; {664#true} is VALID [2022-02-20 17:43:56,549 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {664#true} {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} #54#return; {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {727#(and (<= |ULTIMATE.start_main_~c~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} assume !(main_~c~0#1 < main_~k~0#1); {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,550 INFO L272 TraceCheckUtils]: 27: Hoare triple {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {664#true} is VALID [2022-02-20 17:43:56,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {664#true} ~cond := #in~cond; {756#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:56,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {756#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {760#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:43:56,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {760#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {760#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:43:56,561 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {760#(not (= |__VERIFIER_assert_#in~cond| 0))} {749#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= (+ (- 1) |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| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) (< 0 |ULTIMATE.start_main_~k~0#1|))} #56#return; {767#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:43:56,562 INFO L272 TraceCheckUtils]: 32: Hoare triple {767#(and (<= |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (< 0 |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {771#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:43:56,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {771#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {775#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:43:56,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {775#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {665#false} is VALID [2022-02-20 17:43:56,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {665#false} assume !false; {665#false} is VALID [2022-02-20 17:43:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:43:56,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:11,592 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* |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| 18)) (.cse1 (* |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| |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 119)) (.cse3 (* |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| 65))) (or (not (<= (+ (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) 10) (* |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|) |c_ULTIMATE.start_main_~x~0#1| (* 5 (* |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) (div (+ .cse0 .cse1 .cse2 .cse3 12) 12))) (not (= (mod (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 120) .cse1 .cse2 .cse3) 12) 0)) (forall ((|ULTIMATE.start_main_~k~0#1| Int)) (or (let ((.cse4 (+ |c_ULTIMATE.start_main_~y~0#1| 1))) (= (* |ULTIMATE.start_main_~k~0#1| .cse4) (* .cse4 .cse4))) (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:44:13,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:13,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112252746] [2022-02-20 17:44:13,738 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:13,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613425773] [2022-02-20 17:44:13,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613425773] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:44:13,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:44:13,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-02-20 17:44:13,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577151124] [2022-02-20 17:44:13,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-02-20 17:44:13,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:13,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:13,766 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:44:13,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:44:13,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:44:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2022-02-20 17:44:13,768 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:14,143 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-02-20 17:44:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:44:14,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-02-20 17:44:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-02-20 17:44:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-02-20 17:44:14,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-02-20 17:44:14,184 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:44:14,185 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:44:14,185 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:44:14,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-02-20 17:44:14,186 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:14,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 129 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:44:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:44:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 17:44:14,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:14,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:44:14,199 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:44:14,199 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:44:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:14,201 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:44:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:44:14,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:14,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:14,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 32 states. [2022-02-20 17:44:14,202 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 32 states. [2022-02-20 17:44:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:14,204 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 17:44:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:44:14,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:14,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:14,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:14,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:44:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 17:44:14,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 36 [2022-02-20 17:44:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:14,208 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 17:44:14,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 17:44:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 17:44:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:44:14,209 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:44:14,209 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:44:14,235 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:44:14,431 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:44:14,432 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:44:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:44:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash -426505545, now seen corresponding path program 2 times [2022-02-20 17:44:14,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:44:14,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461923925] [2022-02-20 17:44:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:44:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:44:14,447 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:44:14,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1469502694] [2022-02-20 17:44:14,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:44:14,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:44:14,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:44:14,449 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:44:14,459 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:44:14,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:44:14,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:44:14,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:44:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:44:14,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:44:14,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {1011#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); {1011#true} is VALID [2022-02-20 17:44:14,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#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; {1011#true} is VALID [2022-02-20 17:44:14,791 INFO L272 TraceCheckUtils]: 2: Hoare triple {1011#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:14,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {1011#true} ~cond := #in~cond; {1025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:44:14,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {1025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:14,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {1029#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:14,794 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1029#(not (= |assume_abort_if_not_#in~cond| 0))} {1011#true} #50#return; {1036#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 17:44:14,794 INFO L272 TraceCheckUtils]: 7: Hoare triple {1036#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:14,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:14,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:14,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:14,795 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1011#true} {1036#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} #52#return; {1036#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 17:44:14,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {1036#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:14,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:14,796 INFO L272 TraceCheckUtils]: 14: Hoare triple {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:14,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:14,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:14,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:14,798 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1011#true} {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:14,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {1055#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:14,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} assume !false; {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:14,800 INFO L272 TraceCheckUtils]: 21: Hoare triple {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:14,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:14,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:14,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:14,801 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1011#true} {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} #54#return; {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-20 17:44:14,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {1077#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1012#false} is VALID [2022-02-20 17:44:14,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {1012#false} assume !false; {1012#false} is VALID [2022-02-20 17:44:14,802 INFO L272 TraceCheckUtils]: 28: Hoare triple {1012#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1012#false} is VALID [2022-02-20 17:44:14,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {1012#false} ~cond := #in~cond; {1012#false} is VALID [2022-02-20 17:44:14,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {1012#false} assume !(0 == ~cond); {1012#false} is VALID [2022-02-20 17:44:14,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {1012#false} assume true; {1012#false} is VALID [2022-02-20 17:44:14,803 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1012#false} {1012#false} #54#return; {1012#false} is VALID [2022-02-20 17:44:14,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {1012#false} assume !(main_~c~0#1 < main_~k~0#1); {1012#false} is VALID [2022-02-20 17:44:14,803 INFO L272 TraceCheckUtils]: 34: Hoare triple {1012#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1012#false} is VALID [2022-02-20 17:44:14,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {1012#false} ~cond := #in~cond; {1012#false} is VALID [2022-02-20 17:44:14,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {1012#false} assume !(0 == ~cond); {1012#false} is VALID [2022-02-20 17:44:14,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {1012#false} assume true; {1012#false} is VALID [2022-02-20 17:44:14,804 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1012#false} {1012#false} #56#return; {1012#false} is VALID [2022-02-20 17:44:14,804 INFO L272 TraceCheckUtils]: 39: Hoare triple {1012#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1012#false} is VALID [2022-02-20 17:44:14,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {1012#false} ~cond := #in~cond; {1012#false} is VALID [2022-02-20 17:44:14,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {1012#false} assume 0 == ~cond; {1012#false} is VALID [2022-02-20 17:44:14,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {1012#false} assume !false; {1012#false} is VALID [2022-02-20 17:44:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 17:44:14,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:44:15,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {1012#false} assume !false; {1012#false} is VALID [2022-02-20 17:44:15,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {1012#false} assume 0 == ~cond; {1012#false} is VALID [2022-02-20 17:44:15,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {1012#false} ~cond := #in~cond; {1012#false} is VALID [2022-02-20 17:44:15,093 INFO L272 TraceCheckUtils]: 39: Hoare triple {1012#false} call __VERIFIER_assert((if main_~k~0#1 * main_~y~0#1 == main_~y~0#1 * main_~y~0#1 then 1 else 0)); {1012#false} is VALID [2022-02-20 17:44:15,093 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1011#true} {1012#false} #56#return; {1012#false} is VALID [2022-02-20 17:44:15,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:15,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:15,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:15,094 INFO L272 TraceCheckUtils]: 34: Hoare triple {1012#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:15,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {1012#false} assume !(main_~c~0#1 < main_~k~0#1); {1012#false} is VALID [2022-02-20 17:44:15,094 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1011#true} {1012#false} #54#return; {1012#false} is VALID [2022-02-20 17:44:15,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:15,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:15,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:15,095 INFO L272 TraceCheckUtils]: 28: Hoare triple {1012#false} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:15,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {1012#false} assume !false; {1012#false} is VALID [2022-02-20 17:44:15,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1012#false} is VALID [2022-02-20 17:44:15,100 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1011#true} {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} #54#return; {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:15,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:15,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:15,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:15,100 INFO L272 TraceCheckUtils]: 21: Hoare triple {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:15,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !false; {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:15,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {1217#(<= |ULTIMATE.start_main_~k~0#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_~y~0#1 * main_~y~0#1 + main_~x~0#1; {1195#(not (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:44:15,102 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1011#true} {1217#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} #54#return; {1217#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} is VALID [2022-02-20 17:44:15,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:15,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:15,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:15,103 INFO L272 TraceCheckUtils]: 14: Hoare triple {1217#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} call __VERIFIER_assert((if 0 == -2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 6 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 5 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 + main_~y~0#1 * main_~y~0#1 + 12 * main_~x~0#1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:15,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} assume !false; {1217#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} is VALID [2022-02-20 17:44:15,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {1239#(<= |ULTIMATE.start_main_~k~0#1| 1)} main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {1217#(<= |ULTIMATE.start_main_~k~0#1| (+ |ULTIMATE.start_main_~c~0#1| 1))} is VALID [2022-02-20 17:44:15,108 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1011#true} {1239#(<= |ULTIMATE.start_main_~k~0#1| 1)} #52#return; {1239#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-20 17:44:15,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 17:44:15,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {1011#true} assume !(0 == ~cond); {1011#true} is VALID [2022-02-20 17:44:15,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {1011#true} ~cond := #in~cond; {1011#true} is VALID [2022-02-20 17:44:15,109 INFO L272 TraceCheckUtils]: 7: Hoare triple {1239#(<= |ULTIMATE.start_main_~k~0#1| 1)} call assume_abort_if_not((if main_~k~0#1 <= 256 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:15,109 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1029#(not (= |assume_abort_if_not_#in~cond| 0))} {1011#true} #50#return; {1239#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-20 17:44:15,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {1029#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:15,110 INFO L290 TraceCheckUtils]: 4: Hoare triple {1267#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:44:15,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {1011#true} ~cond := #in~cond; {1267#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 17:44:15,111 INFO L272 TraceCheckUtils]: 2: Hoare triple {1011#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 1 then 1 else 0)); {1011#true} is VALID [2022-02-20 17:44:15,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#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; {1011#true} is VALID [2022-02-20 17:44:15,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {1011#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); {1011#true} is VALID [2022-02-20 17:44:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 17:44:15,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:44:15,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461923925] [2022-02-20 17:44:15,112 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:44:15,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469502694] [2022-02-20 17:44:15,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469502694] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:44:15,112 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:44:15,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 17:44:15,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028395820] [2022-02-20 17:44:15,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:44:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Word has length 43 [2022-02-20 17:44:15,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:44:15,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 17:44:15,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:15,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 17:44:15,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:44:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 17:44:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:44:15,170 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 17:44:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:15,312 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-02-20 17:44:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:44:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) Word has length 43 [2022-02-20 17:44:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:44:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 17:44:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-02-20 17:44:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 17:44:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-02-20 17:44:15,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-02-20 17:44:15,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:44:15,346 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:44:15,346 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:44:15,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:44:15,347 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:44:15,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:44:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:44:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:44:15,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:44:15,348 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:44:15,349 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:44:15,349 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:44:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:15,349 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:15,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:15,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:15,350 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:44:15,350 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:44:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:44:15,350 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:44:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:15,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:15,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:44:15,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:44:15,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:44:15,351 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:44:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:44:15,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-02-20 17:44:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:44:15,351 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:44:15,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 8 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 17:44:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:44:15,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:44:15,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:44:15,374 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:44:15,563 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:44:15,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:44:15,798 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:44:15,798 INFO L854 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~k~0#1| 1))) (or (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)))) [2022-02-20 17:44:15,798 INFO L858 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2022-02-20 17:44:15,798 INFO L861 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-02-20 17:44:15,799 INFO L854 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1)) [2022-02-20 17:44:15,799 INFO L858 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-02-20 17:44:15,799 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:44:15,799 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:44:15,799 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:44:15,799 INFO L854 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~k~0#1| 1))) (or (and .cse0 (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0)))) [2022-02-20 17:44:15,799 INFO L854 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))) [2022-02-20 17:44:15,799 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-20 17:44:15,799 INFO L861 garLoopResultBuilder]: At program point L41(lines 17 42) the Hoare annotation is: true [2022-02-20 17:44:15,800 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_~k~0#1| 1) (<= |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (= (+ (* 6 (* |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|)) (* 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|)) (* 5 (* |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| 12) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (< 0 |ULTIMATE.start_main_~k~0#1|)) (and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))) [2022-02-20 17:44:15,800 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:44:15,800 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 17:44:15,803 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-02-20 17:44:15,805 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:44:15,807 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:44:15,807 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-02-20 17:44:15,808 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:44:15,809 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:44:15,810 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:44:15,810 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:44:15,810 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:44:15,810 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:44:15,816 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:15,817 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:44:15,817 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:44:15,817 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:44:15,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:44:15 BoogieIcfgContainer [2022-02-20 17:44:15,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:44:15,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:44:15,826 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:44:15,826 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:44:15,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:43:41" (3/4) ... [2022-02-20 17:44:15,829 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:44:15,833 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:44:15,833 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:44:15,836 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:44:15,836 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:44:15,836 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:44:15,837 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:44:15,861 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:44:15,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:44:15,863 INFO L158 Benchmark]: Toolchain (without parser) took 35324.21ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 67.9MB in the beginning and 78.5MB in the end (delta: -10.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:15,863 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:15,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.71ms. Allocated memory is still 88.1MB. Free memory was 67.5MB in the beginning and 66.9MB in the end (delta: 566.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:44:15,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.97ms. Allocated memory is still 88.1MB. Free memory was 66.9MB in the beginning and 65.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:44:15,864 INFO L158 Benchmark]: Boogie Preprocessor took 38.28ms. Allocated memory is still 88.1MB. Free memory was 65.2MB in the beginning and 64.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:15,864 INFO L158 Benchmark]: RCFGBuilder took 310.77ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 53.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:44:15,865 INFO L158 Benchmark]: TraceAbstraction took 34637.82ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 53.1MB in the beginning and 80.6MB in the end (delta: -27.4MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-02-20 17:44:15,865 INFO L158 Benchmark]: Witness Printer took 35.92ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 78.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:44:15,867 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.20ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.71ms. Allocated memory is still 88.1MB. Free memory was 67.5MB in the beginning and 66.9MB in the end (delta: 566.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.97ms. Allocated memory is still 88.1MB. Free memory was 66.9MB in the beginning and 65.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.28ms. Allocated memory is still 88.1MB. Free memory was 65.2MB in the beginning and 64.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.77ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 53.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34637.82ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 53.1MB in the beginning and 80.6MB in the end (delta: -27.4MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 35.92ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 78.5MB 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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 368 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 268 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 100 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 177 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 22 PreInvPairs, 32 NumberOfFragments, 251 HoareAnnotationTreeSize, 22 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 102 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 667 SizeOfPredicates, 7 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 127/139 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: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((k <= 1 && c <= 1) && 1 <= c) && y == 1) && 6 * (y * y * y * y * y) + 2 * (y * y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) || ((((0 <= k && c == 0) && k <= 1) && y == 0) && x == 0) RESULT: Ultimate proved your program to be correct! [2022-02-20 17:44:15,887 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