./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 818b016b2d9c78b614346b2c46d89ec48ae39fe7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:44:15,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:44:15,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:44:15,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:44:15,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:44:15,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:44:15,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:44:15,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:44:15,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:44:15,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:44:15,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:44:15,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:44:15,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:44:15,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:44:15,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:44:15,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:44:15,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:44:15,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:44:15,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:44:15,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:44:15,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:44:16,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:44:16,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:44:16,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:44:16,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:44:16,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:44:16,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:44:16,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:44:16,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:44:16,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:44:16,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:44:16,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:44:16,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:44:16,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:44:16,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:44:16,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:44:16,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:44:16,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:44:16,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:44:16,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:44:16,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:44:16,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:44:16,052 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:44:16,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:44:16,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:44:16,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:44:16,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:44:16,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:44:16,056 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:44:16,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:44:16,056 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:44:16,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:44:16,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:44:16,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:44:16,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:44:16,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:44:16,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:44:16,058 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:44:16,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:44:16,058 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:44:16,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:44:16,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:44:16,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:44:16,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:44:16,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:44:16,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:44:16,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:44:16,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:44:16,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:44:16,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:44:16,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:44:16,066 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:44:16,066 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 -> 818b016b2d9c78b614346b2c46d89ec48ae39fe7 [2021-09-13 14:44:16,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:44:16,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:44:16,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:44:16,367 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:44:16,367 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:44:16,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2021-09-13 14:44:16,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7e4186f/c1dbbb1dba7043bfaece1829af2ad0ac/FLAG1ed07f03b [2021-09-13 14:44:16,855 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:44:16,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2021-09-13 14:44:16,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7e4186f/c1dbbb1dba7043bfaece1829af2ad0ac/FLAG1ed07f03b [2021-09-13 14:44:16,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e7e4186f/c1dbbb1dba7043bfaece1829af2ad0ac [2021-09-13 14:44:16,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:44:16,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:44:16,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:44:16,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:44:16,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:44:16,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:44:16" (1/1) ... [2021-09-13 14:44:16,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72914a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:16, skipping insertion in model container [2021-09-13 14:44:16,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:44:16" (1/1) ... [2021-09-13 14:44:16,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:44:16,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:44:17,034 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2021-09-13 14:44:17,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:44:17,056 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:44:17,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2021-09-13 14:44:17,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:44:17,083 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:44:17,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17 WrapperNode [2021-09-13 14:44:17,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:44:17,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:44:17,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:44:17,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:44:17,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:44:17,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:44:17,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:44:17,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:44:17,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:44:17,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:44:17,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:44:17,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:44:17,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (1/1) ... [2021-09-13 14:44:17,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:44:17,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:44:17,190 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) [2021-09-13 14:44:17,213 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 [2021-09-13 14:44:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:44:17,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:44:17,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:44:17,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:44:17,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:44:17,443 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-09-13 14:44:17,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:44:17 BoogieIcfgContainer [2021-09-13 14:44:17,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:44:17,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:44:17,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:44:17,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:44:17,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:44:16" (1/3) ... [2021-09-13 14:44:17,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b77bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:44:17, skipping insertion in model container [2021-09-13 14:44:17,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:44:17" (2/3) ... [2021-09-13 14:44:17,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b77bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:44:17, skipping insertion in model container [2021-09-13 14:44:17,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:44:17" (3/3) ... [2021-09-13 14:44:17,469 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2021-09-13 14:44:17,473 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:44:17,473 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-09-13 14:44:17,507 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:44:17,512 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-13 14:44:17,513 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-09-13 14:44:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 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) [2021-09-13 14:44:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:44:17,534 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:44:17,534 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:44:17,535 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:44:17,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:44:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-09-13 14:44:17,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:44:17,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452711992] [2021-09-13 14:44:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:17,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:44:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:17,716 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {24#true} is VALID [2021-09-13 14:44:17,716 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 14:44:17,717 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 14:44:17,718 INFO L281 TraceCheckUtils]: 3: Hoare triple {25#false} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {25#false} is VALID [2021-09-13 14:44:17,718 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 14:44:17,718 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 14:44:17,718 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 14:44:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:17,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:44:17,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452711992] [2021-09-13 14:44:17,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452711992] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:44:17,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:44:17,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:44:17,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837173911] [2021-09-13 14:44:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:44:17,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:44:17,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:44:17,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:17,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:44:17,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:44:17,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:44:17,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:44:17,783 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 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 has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:44:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:17,859 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2021-09-13 14:44:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:44:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:44:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:44:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:44:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2021-09-13 14:44:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:44:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2021-09-13 14:44:17,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2021-09-13 14:44:17,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:17,979 INFO L225 Difference]: With dead ends: 39 [2021-09-13 14:44:17,980 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:44:17,982 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:44:17,991 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.48ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.39ms IncrementalHoareTripleChecker+Time [2021-09-13 14:44:17,992 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.48ms Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 29.39ms Time] [2021-09-13 14:44:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:44:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 14:44:18,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:44:18,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:18,015 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:18,016 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:18,018 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-09-13 14:44:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:44:18,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:18,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:18,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2021-09-13 14:44:18,019 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2021-09-13 14:44:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:18,021 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-09-13 14:44:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:44:18,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:18,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:18,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:44:18,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:44:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-09-13 14:44:18,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2021-09-13 14:44:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:44:18,026 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-09-13 14:44:18,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-09-13 14:44:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:44:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:44:18,027 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:44:18,027 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:44:18,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:44:18,027 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:44:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:44:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-09-13 14:44:18,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:44:18,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945122991] [2021-09-13 14:44:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:18,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:44:18,046 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:44:18,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64288171] [2021-09-13 14:44:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:18,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:44:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:44:18,050 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) [2021-09-13 14:44:18,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:44:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:18,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:44:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:18,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:44:18,269 INFO L281 TraceCheckUtils]: 0: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {131#true} is VALID [2021-09-13 14:44:18,270 INFO L281 TraceCheckUtils]: 1: Hoare triple {131#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {131#true} is VALID [2021-09-13 14:44:18,270 INFO L281 TraceCheckUtils]: 2: Hoare triple {131#true} assume !(0 == assume_abort_if_not_~cond); {131#true} is VALID [2021-09-13 14:44:18,271 INFO L281 TraceCheckUtils]: 3: Hoare triple {131#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {145#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:44:18,271 INFO L281 TraceCheckUtils]: 4: Hoare triple {145#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {149#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:18,272 INFO L281 TraceCheckUtils]: 5: Hoare triple {149#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {132#false} is VALID [2021-09-13 14:44:18,272 INFO L281 TraceCheckUtils]: 6: Hoare triple {132#false} assume !false; {132#false} is VALID [2021-09-13 14:44:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:18,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:44:18,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:44:18,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945122991] [2021-09-13 14:44:18,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:44:18,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64288171] [2021-09-13 14:44:18,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64288171] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:44:18,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:44:18,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:44:18,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397801369] [2021-09-13 14:44:18,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:44:18,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:44:18,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:44:18,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:18,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:44:18,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:44:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:44:18,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:44:18,285 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:44:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:18,851 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2021-09-13 14:44:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:44:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2021-09-13 14:44:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:44:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:44:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:44:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:44:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:44:18,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2021-09-13 14:44:18,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:18,896 INFO L225 Difference]: With dead ends: 31 [2021-09-13 14:44:18,898 INFO L226 Difference]: Without dead ends: 21 [2021-09-13 14:44:18,898 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.86ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:44:18,900 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 453.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 455.31ms IncrementalHoareTripleChecker+Time [2021-09-13 14:44:18,901 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 455.31ms Time] [2021-09-13 14:44:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-09-13 14:44:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-09-13 14:44:18,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:44:18,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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) [2021-09-13 14:44:18,922 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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) [2021-09-13 14:44:18,922 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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) [2021-09-13 14:44:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:18,923 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:44:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-09-13 14:44:18,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:18,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:18,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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 21 states. [2021-09-13 14:44:18,926 INFO L87 Difference]: Start difference. First operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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 21 states. [2021-09-13 14:44:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:18,928 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:44:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-09-13 14:44:18,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:18,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:18,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:44:18,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:44:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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) [2021-09-13 14:44:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-09-13 14:44:18,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2021-09-13 14:44:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:44:18,933 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-09-13 14:44:18,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-09-13 14:44:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-09-13 14:44:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:44:18,934 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:44:18,934 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:44:18,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:44:19,157 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 [2021-09-13 14:44:19,157 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:44:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:44:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1864186656, now seen corresponding path program 1 times [2021-09-13 14:44:19,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:44:19,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135370628] [2021-09-13 14:44:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:19,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:44:19,173 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:44:19,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118001472] [2021-09-13 14:44:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:19,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:44:19,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:44:19,176 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) [2021-09-13 14:44:19,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:44:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:19,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:44:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:19,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:44:19,452 INFO L281 TraceCheckUtils]: 0: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {262#true} is VALID [2021-09-13 14:44:19,452 INFO L281 TraceCheckUtils]: 1: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#true} is VALID [2021-09-13 14:44:19,452 INFO L281 TraceCheckUtils]: 2: Hoare triple {262#true} assume !(0 == assume_abort_if_not_~cond); {262#true} is VALID [2021-09-13 14:44:19,453 INFO L281 TraceCheckUtils]: 3: Hoare triple {262#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:44:19,454 INFO L281 TraceCheckUtils]: 4: Hoare triple {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:44:19,455 INFO L281 TraceCheckUtils]: 5: Hoare triple {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !(0 == __VERIFIER_assert_~cond); {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} is VALID [2021-09-13 14:44:19,456 INFO L281 TraceCheckUtils]: 6: Hoare triple {276#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {286#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:44:19,457 INFO L281 TraceCheckUtils]: 7: Hoare triple {286#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:19,458 INFO L281 TraceCheckUtils]: 8: Hoare triple {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {263#false} is VALID [2021-09-13 14:44:19,458 INFO L281 TraceCheckUtils]: 9: Hoare triple {263#false} assume !false; {263#false} is VALID [2021-09-13 14:44:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:19,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:44:19,642 INFO L281 TraceCheckUtils]: 9: Hoare triple {263#false} assume !false; {263#false} is VALID [2021-09-13 14:44:19,643 INFO L281 TraceCheckUtils]: 8: Hoare triple {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {263#false} is VALID [2021-09-13 14:44:19,644 INFO L281 TraceCheckUtils]: 7: Hoare triple {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:20,124 INFO L281 TraceCheckUtils]: 6: Hoare triple {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:44:20,124 INFO L281 TraceCheckUtils]: 5: Hoare triple {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:44:20,125 INFO L281 TraceCheckUtils]: 4: Hoare triple {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:44:20,125 INFO L281 TraceCheckUtils]: 3: Hoare triple {262#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {303#(= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:44:20,125 INFO L281 TraceCheckUtils]: 2: Hoare triple {262#true} assume !(0 == assume_abort_if_not_~cond); {262#true} is VALID [2021-09-13 14:44:20,126 INFO L281 TraceCheckUtils]: 1: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {262#true} is VALID [2021-09-13 14:44:20,126 INFO L281 TraceCheckUtils]: 0: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {262#true} is VALID [2021-09-13 14:44:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:44:20,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:44:20,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135370628] [2021-09-13 14:44:20,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:44:20,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118001472] [2021-09-13 14:44:20,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118001472] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:44:20,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:44:20,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-09-13 14:44:20,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726969031] [2021-09-13 14:44:20,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 10 [2021-09-13 14:44:20,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:44:20,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-09-13 14:44:20,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:20,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:44:20,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:44:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:44:20,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:44:20,226 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-09-13 14:44:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:20,412 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-09-13 14:44:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:44:20,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 10 [2021-09-13 14:44:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:44:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-09-13 14:44:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2021-09-13 14:44:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-09-13 14:44:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2021-09-13 14:44:20,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2021-09-13 14:44:20,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:20,541 INFO L225 Difference]: With dead ends: 29 [2021-09-13 14:44:20,541 INFO L226 Difference]: Without dead ends: 21 [2021-09-13 14:44:20,541 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.71ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:44:20,542 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.88ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.06ms IncrementalHoareTripleChecker+Time [2021-09-13 14:44:20,542 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.88ms Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 68.06ms Time] [2021-09-13 14:44:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-09-13 14:44:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2021-09-13 14:44:20,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:44:20,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:44:20,558 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:44:20,558 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:44:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:20,559 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:44:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-09-13 14:44:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:20,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:20,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 21 states. [2021-09-13 14:44:20,560 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 21 states. [2021-09-13 14:44:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:20,562 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:44:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-09-13 14:44:20,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:20,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:20,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:44:20,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:44:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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) [2021-09-13 14:44:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-09-13 14:44:20,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2021-09-13 14:44:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:44:20,564 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-09-13 14:44:20,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2021-09-13 14:44:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-09-13 14:44:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:44:20,565 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:44:20,565 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:44:20,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-09-13 14:44:20,780 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 [2021-09-13 14:44:20,781 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:44:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:44:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2052638844, now seen corresponding path program 1 times [2021-09-13 14:44:20,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:44:20,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636144339] [2021-09-13 14:44:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:20,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:44:20,793 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:44:20,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838395757] [2021-09-13 14:44:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:20,793 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:44:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:44:20,794 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) [2021-09-13 14:44:20,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:44:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:20,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:44:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:20,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:44:21,178 INFO L281 TraceCheckUtils]: 0: Hoare triple {427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {427#true} is VALID [2021-09-13 14:44:21,179 INFO L281 TraceCheckUtils]: 1: Hoare triple {427#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {427#true} is VALID [2021-09-13 14:44:21,179 INFO L281 TraceCheckUtils]: 2: Hoare triple {427#true} assume !(0 == assume_abort_if_not_~cond); {427#true} is VALID [2021-09-13 14:44:21,180 INFO L281 TraceCheckUtils]: 3: Hoare triple {427#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {441#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:21,180 INFO L281 TraceCheckUtils]: 4: Hoare triple {441#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {441#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:21,181 INFO L281 TraceCheckUtils]: 5: Hoare triple {441#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {441#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:21,181 INFO L281 TraceCheckUtils]: 6: Hoare triple {441#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {451#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:21,182 INFO L281 TraceCheckUtils]: 7: Hoare triple {451#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {451#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:21,183 INFO L281 TraceCheckUtils]: 8: Hoare triple {451#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {451#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:21,183 INFO L281 TraceCheckUtils]: 9: Hoare triple {451#(and (< 0 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 1) (<= ULTIMATE.start_main_~c~0 1))} assume !(main_~c~0 < main_~k~0); {461#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} is VALID [2021-09-13 14:44:21,184 INFO L281 TraceCheckUtils]: 10: Hoare triple {461#(and (< 0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~y~0 1))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {465#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:21,184 INFO L281 TraceCheckUtils]: 11: Hoare triple {465#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {428#false} is VALID [2021-09-13 14:44:21,185 INFO L281 TraceCheckUtils]: 12: Hoare triple {428#false} assume !false; {428#false} is VALID [2021-09-13 14:44:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:21,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:44:21,782 INFO L281 TraceCheckUtils]: 12: Hoare triple {428#false} assume !false; {428#false} is VALID [2021-09-13 14:44:21,783 INFO L281 TraceCheckUtils]: 11: Hoare triple {465#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {428#false} is VALID [2021-09-13 14:44:21,784 INFO L281 TraceCheckUtils]: 10: Hoare triple {478#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {465#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:21,784 INFO L281 TraceCheckUtils]: 9: Hoare triple {482#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {478#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:44:21,785 INFO L281 TraceCheckUtils]: 8: Hoare triple {482#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {482#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:21,785 INFO L281 TraceCheckUtils]: 7: Hoare triple {482#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:21,802 INFO L281 TraceCheckUtils]: 6: Hoare triple {492#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {482#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:21,803 INFO L281 TraceCheckUtils]: 5: Hoare triple {492#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {492#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:44:21,804 INFO L281 TraceCheckUtils]: 4: Hoare triple {492#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {492#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:44:21,804 INFO L281 TraceCheckUtils]: 3: Hoare triple {427#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {492#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:44:21,805 INFO L281 TraceCheckUtils]: 2: Hoare triple {427#true} assume !(0 == assume_abort_if_not_~cond); {427#true} is VALID [2021-09-13 14:44:21,805 INFO L281 TraceCheckUtils]: 1: Hoare triple {427#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {427#true} is VALID [2021-09-13 14:44:21,805 INFO L281 TraceCheckUtils]: 0: Hoare triple {427#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {427#true} is VALID [2021-09-13 14:44:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:21,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:44:21,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636144339] [2021-09-13 14:44:21,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:44:21,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838395757] [2021-09-13 14:44:21,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838395757] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:44:21,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:44:21,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:44:21,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537751758] [2021-09-13 14:44:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) Word has length 13 [2021-09-13 14:44:21,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:44:21,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-09-13 14:44:21,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:21,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:44:21,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:44:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:44:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:44:21,929 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-09-13 14:44:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:22,111 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-09-13 14:44:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:44:22,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) Word has length 13 [2021-09-13 14:44:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:44:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-09-13 14:44:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2021-09-13 14:44:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-09-13 14:44:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2021-09-13 14:44:22,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2021-09-13 14:44:22,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:22,133 INFO L225 Difference]: With dead ends: 21 [2021-09-13 14:44:22,133 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:44:22,133 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 150.70ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:44:22,134 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.94ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 72.50ms IncrementalHoareTripleChecker+Time [2021-09-13 14:44:22,134 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.94ms Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 15 Unchecked, 72.50ms Time] [2021-09-13 14:44:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:44:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 14:44:22,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:44:22,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:22,150 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:22,150 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:22,151 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-09-13 14:44:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:44:22,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:22,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:22,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2021-09-13 14:44:22,152 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2021-09-13 14:44:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:22,153 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2021-09-13 14:44:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:44:22,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:22,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:22,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:44:22,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:44:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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) [2021-09-13 14:44:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-09-13 14:44:22,155 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2021-09-13 14:44:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:44:22,156 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-09-13 14:44:22,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2021-09-13 14:44:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-09-13 14:44:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:44:22,156 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:44:22,157 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:44:22,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:44:22,373 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 [2021-09-13 14:44:22,374 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:44:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:44:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1496575115, now seen corresponding path program 2 times [2021-09-13 14:44:22,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:44:22,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758534413] [2021-09-13 14:44:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:22,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:44:22,382 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:44:22,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118709035] [2021-09-13 14:44:22,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:44:22,383 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:44:22,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:44:22,386 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) [2021-09-13 14:44:22,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:44:22,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:44:22,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:44:22,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:44:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:22,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:44:22,821 INFO L281 TraceCheckUtils]: 0: Hoare triple {598#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {598#true} is VALID [2021-09-13 14:44:22,821 INFO L281 TraceCheckUtils]: 1: Hoare triple {598#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {598#true} is VALID [2021-09-13 14:44:22,821 INFO L281 TraceCheckUtils]: 2: Hoare triple {598#true} assume !(0 == assume_abort_if_not_~cond); {598#true} is VALID [2021-09-13 14:44:22,822 INFO L281 TraceCheckUtils]: 3: Hoare triple {598#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {612#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:22,822 INFO L281 TraceCheckUtils]: 4: Hoare triple {612#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {612#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:22,822 INFO L281 TraceCheckUtils]: 5: Hoare triple {612#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {612#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:22,823 INFO L281 TraceCheckUtils]: 6: Hoare triple {612#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {622#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:22,824 INFO L281 TraceCheckUtils]: 7: Hoare triple {622#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {622#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:22,824 INFO L281 TraceCheckUtils]: 8: Hoare triple {622#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {622#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:22,824 INFO L281 TraceCheckUtils]: 9: Hoare triple {622#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~c~0 1))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {632#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:44:22,825 INFO L281 TraceCheckUtils]: 10: Hoare triple {632#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {632#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:44:22,825 INFO L281 TraceCheckUtils]: 11: Hoare triple {632#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(0 == __VERIFIER_assert_~cond); {632#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:44:22,826 INFO L281 TraceCheckUtils]: 12: Hoare triple {632#(and (<= ULTIMATE.start_main_~c~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} assume !(main_~c~0 < main_~k~0); {642#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} is VALID [2021-09-13 14:44:22,827 INFO L281 TraceCheckUtils]: 13: Hoare triple {642#(and (<= ULTIMATE.start_main_~k~0 2) (< 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 2))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {646#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:22,827 INFO L281 TraceCheckUtils]: 14: Hoare triple {646#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {599#false} is VALID [2021-09-13 14:44:22,827 INFO L281 TraceCheckUtils]: 15: Hoare triple {599#false} assume !false; {599#false} is VALID [2021-09-13 14:44:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:22,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:44:23,988 INFO L281 TraceCheckUtils]: 15: Hoare triple {599#false} assume !false; {599#false} is VALID [2021-09-13 14:44:23,988 INFO L281 TraceCheckUtils]: 14: Hoare triple {646#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {599#false} is VALID [2021-09-13 14:44:23,989 INFO L281 TraceCheckUtils]: 13: Hoare triple {659#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {646#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:23,990 INFO L281 TraceCheckUtils]: 12: Hoare triple {663#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {659#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:44:23,990 INFO L281 TraceCheckUtils]: 11: Hoare triple {663#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {663#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:23,990 INFO L281 TraceCheckUtils]: 10: Hoare triple {663#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {663#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:24,015 INFO L281 TraceCheckUtils]: 9: Hoare triple {673#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {663#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:24,016 INFO L281 TraceCheckUtils]: 8: Hoare triple {673#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !(0 == __VERIFIER_assert_~cond); {673#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:44:24,016 INFO L281 TraceCheckUtils]: 7: Hoare triple {673#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {673#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:44:24,453 INFO L281 TraceCheckUtils]: 6: Hoare triple {683#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {673#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0)))} is VALID [2021-09-13 14:44:24,454 INFO L281 TraceCheckUtils]: 5: Hoare triple {683#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !(0 == __VERIFIER_assert_~cond); {683#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:44:24,457 INFO L281 TraceCheckUtils]: 4: Hoare triple {683#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {683#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:44:24,458 INFO L281 TraceCheckUtils]: 3: Hoare triple {598#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {683#(forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)))))} is VALID [2021-09-13 14:44:24,458 INFO L281 TraceCheckUtils]: 2: Hoare triple {598#true} assume !(0 == assume_abort_if_not_~cond); {598#true} is VALID [2021-09-13 14:44:24,459 INFO L281 TraceCheckUtils]: 1: Hoare triple {598#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {598#true} is VALID [2021-09-13 14:44:24,459 INFO L281 TraceCheckUtils]: 0: Hoare triple {598#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {598#true} is VALID [2021-09-13 14:44:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:24,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:44:24,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758534413] [2021-09-13 14:44:24,459 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:44:24,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118709035] [2021-09-13 14:44:24,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118709035] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:44:24,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:44:24,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-09-13 14:44:24,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553045902] [2021-09-13 14:44:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) Word has length 16 [2021-09-13 14:44:24,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:44:24,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) [2021-09-13 14:44:24,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:24,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:44:24,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:44:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:44:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:44:24,931 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) [2021-09-13 14:44:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:25,225 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-09-13 14:44:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:44:25,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) Word has length 16 [2021-09-13 14:44:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:44:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) [2021-09-13 14:44:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2021-09-13 14:44:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) [2021-09-13 14:44:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2021-09-13 14:44:25,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2021-09-13 14:44:25,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:25,282 INFO L225 Difference]: With dead ends: 31 [2021-09-13 14:44:25,282 INFO L226 Difference]: Without dead ends: 26 [2021-09-13 14:44:25,282 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 451.47ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:44:25,283 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.20ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 59.23ms IncrementalHoareTripleChecker+Time [2021-09-13 14:44:25,283 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 1.20ms Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 23 Unchecked, 59.23ms Time] [2021-09-13 14:44:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-09-13 14:44:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-09-13 14:44:25,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:44:25,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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) [2021-09-13 14:44:25,339 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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) [2021-09-13 14:44:25,340 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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) [2021-09-13 14:44:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:25,340 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2021-09-13 14:44:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2021-09-13 14:44:25,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:25,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:25,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 26 states. [2021-09-13 14:44:25,341 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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 26 states. [2021-09-13 14:44:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:25,342 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2021-09-13 14:44:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2021-09-13 14:44:25,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:25,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:25,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:44:25,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:44:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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) [2021-09-13 14:44:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2021-09-13 14:44:25,344 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 16 [2021-09-13 14:44:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:44:25,344 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2021-09-13 14:44:25,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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) [2021-09-13 14:44:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2021-09-13 14:44:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-13 14:44:25,345 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:44:25,345 INFO L513 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:44:25,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:44:25,566 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 [2021-09-13 14:44:25,567 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:44:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:44:25,567 INFO L82 PathProgramCache]: Analyzing trace with hash -755348412, now seen corresponding path program 3 times [2021-09-13 14:44:25,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:44:25,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388998340] [2021-09-13 14:44:25,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:44:25,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:44:25,576 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:44:25,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994853146] [2021-09-13 14:44:25,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:44:25,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:44:25,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:44:25,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:44:25,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:44:25,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-09-13 14:44:25,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:44:25,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 50 conjunts are in the unsatisfiable core [2021-09-13 14:44:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:44:25,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:44:26,543 INFO L281 TraceCheckUtils]: 0: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {842#true} is VALID [2021-09-13 14:44:26,543 INFO L281 TraceCheckUtils]: 1: Hoare triple {842#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {842#true} is VALID [2021-09-13 14:44:26,543 INFO L281 TraceCheckUtils]: 2: Hoare triple {842#true} assume !(0 == assume_abort_if_not_~cond); {842#true} is VALID [2021-09-13 14:44:26,544 INFO L281 TraceCheckUtils]: 3: Hoare triple {842#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {856#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:26,544 INFO L281 TraceCheckUtils]: 4: Hoare triple {856#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {856#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:26,545 INFO L281 TraceCheckUtils]: 5: Hoare triple {856#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {856#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:44:26,546 INFO L281 TraceCheckUtils]: 6: Hoare triple {856#(and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {866#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:26,546 INFO L281 TraceCheckUtils]: 7: Hoare triple {866#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~c~0 1))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {866#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:26,547 INFO L281 TraceCheckUtils]: 8: Hoare triple {866#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~c~0 1))} assume !(0 == __VERIFIER_assert_~cond); {866#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~c~0 1))} is VALID [2021-09-13 14:44:26,548 INFO L281 TraceCheckUtils]: 9: Hoare triple {866#(and (= ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_main_~x~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~c~0 1))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {876#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2) (= (+ ULTIMATE.start_main_~x~0 (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1) (+ (* 3 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:44:26,548 INFO L281 TraceCheckUtils]: 10: Hoare triple {876#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2) (= (+ ULTIMATE.start_main_~x~0 (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1) (+ (* 3 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {880#(and (= ULTIMATE.start_main_~c~0 2) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~y~0 2) (= (+ ULTIMATE.start_main_~x~0 (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1) (+ (* 3 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:44:26,549 INFO L281 TraceCheckUtils]: 11: Hoare triple {880#(and (= ULTIMATE.start_main_~c~0 2) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~y~0 2) (= (+ ULTIMATE.start_main_~x~0 (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1) (+ (* 3 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))))} assume !(0 == __VERIFIER_assert_~cond); {876#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2) (= (+ ULTIMATE.start_main_~x~0 (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1) (+ (* 3 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:44:26,550 INFO L281 TraceCheckUtils]: 12: Hoare triple {876#(and (= ULTIMATE.start_main_~c~0 2) (= ULTIMATE.start_main_~y~0 2) (= (+ ULTIMATE.start_main_~x~0 (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) 1) (+ (* 3 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {887#(and (= (+ ULTIMATE.start_main_~x~0 9 (* 9 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 15 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:44:26,552 INFO L281 TraceCheckUtils]: 13: Hoare triple {887#(and (= (+ ULTIMATE.start_main_~x~0 9 (* 9 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 15 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {887#(and (= (+ ULTIMATE.start_main_~x~0 9 (* 9 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 15 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:44:26,553 INFO L281 TraceCheckUtils]: 14: Hoare triple {887#(and (= (+ ULTIMATE.start_main_~x~0 9 (* 9 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 15 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !(0 == __VERIFIER_assert_~cond); {887#(and (= (+ ULTIMATE.start_main_~x~0 9 (* 9 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 15 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} is VALID [2021-09-13 14:44:26,554 INFO L281 TraceCheckUtils]: 15: Hoare triple {887#(and (= (+ ULTIMATE.start_main_~x~0 9 (* 9 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (+ (* 3 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (* 15 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 3) (= ULTIMATE.start_main_~c~0 3))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {897#(and (= ULTIMATE.start_main_~x~0 (+ 36 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:44:26,554 INFO L281 TraceCheckUtils]: 16: Hoare triple {897#(and (= ULTIMATE.start_main_~x~0 (+ 36 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {897#(and (= ULTIMATE.start_main_~x~0 (+ 36 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:44:26,555 INFO L281 TraceCheckUtils]: 17: Hoare triple {897#(and (= ULTIMATE.start_main_~x~0 (+ 36 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !(0 == __VERIFIER_assert_~cond); {897#(and (= ULTIMATE.start_main_~x~0 (+ 36 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} is VALID [2021-09-13 14:44:26,555 INFO L281 TraceCheckUtils]: 18: Hoare triple {897#(and (= ULTIMATE.start_main_~x~0 (+ 36 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~y~0 4) (= ULTIMATE.start_main_~c~0 4))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {907#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= (+ 100 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:44:26,556 INFO L281 TraceCheckUtils]: 19: Hoare triple {907#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= (+ 100 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~x~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {911#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:44:26,557 INFO L281 TraceCheckUtils]: 20: Hoare triple {911#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {915#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} is VALID [2021-09-13 14:44:26,557 INFO L281 TraceCheckUtils]: 21: Hoare triple {915#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~c~0 5))} assume !(main_~c~0 < main_~k~0); {919#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5))} is VALID [2021-09-13 14:44:26,558 INFO L281 TraceCheckUtils]: 22: Hoare triple {919#(and (< 4 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~y~0 5) (<= ULTIMATE.start_main_~k~0 5))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {923#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:26,560 INFO L281 TraceCheckUtils]: 23: Hoare triple {923#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {843#false} is VALID [2021-09-13 14:44:26,560 INFO L281 TraceCheckUtils]: 24: Hoare triple {843#false} assume !false; {843#false} is VALID [2021-09-13 14:44:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:26,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:44:28,980 INFO L281 TraceCheckUtils]: 24: Hoare triple {843#false} assume !false; {843#false} is VALID [2021-09-13 14:44:28,981 INFO L281 TraceCheckUtils]: 23: Hoare triple {923#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {843#false} is VALID [2021-09-13 14:44:28,981 INFO L281 TraceCheckUtils]: 22: Hoare triple {936#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~k~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {923#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:44:28,982 INFO L281 TraceCheckUtils]: 21: Hoare triple {940#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(main_~c~0 < main_~k~0); {936#(= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:44:28,983 INFO L281 TraceCheckUtils]: 20: Hoare triple {944#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !(0 == __VERIFIER_assert_~cond); {940#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:28,983 INFO L281 TraceCheckUtils]: 19: Hoare triple {948#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {944#(or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:44:31,201 INFO L281 TraceCheckUtils]: 18: Hoare triple {952#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {948#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:44:31,201 INFO L281 TraceCheckUtils]: 17: Hoare triple {952#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))))} assume !(0 == __VERIFIER_assert_~cond); {952#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))))} is VALID [2021-09-13 14:44:31,213 INFO L281 TraceCheckUtils]: 16: Hoare triple {952#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {952#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))))} is VALID [2021-09-13 14:44:31,254 INFO L281 TraceCheckUtils]: 15: Hoare triple {962#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {952#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))))} is VALID [2021-09-13 14:44:31,255 INFO L281 TraceCheckUtils]: 14: Hoare triple {962#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))} assume !(0 == __VERIFIER_assert_~cond); {962#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:44:31,255 INFO L281 TraceCheckUtils]: 13: Hoare triple {962#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {962#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:44:33,259 INFO L281 TraceCheckUtils]: 12: Hoare triple {972#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {962#(or (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 1)) (= (+ (* 4 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 4) (+ (* 2 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))) (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))} is UNKNOWN [2021-09-13 14:44:33,260 INFO L281 TraceCheckUtils]: 11: Hoare triple {976#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} assume !(0 == __VERIFIER_assert_~cond); {972#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} is VALID [2021-09-13 14:44:33,263 INFO L281 TraceCheckUtils]: 10: Hoare triple {972#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {976#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} is VALID [2021-09-13 14:44:36,375 INFO L281 TraceCheckUtils]: 9: Hoare triple {983#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {972#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))))} is UNKNOWN [2021-09-13 14:44:36,375 INFO L281 TraceCheckUtils]: 8: Hoare triple {983#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} assume !(0 == __VERIFIER_assert_~cond); {983#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} is VALID [2021-09-13 14:44:36,376 INFO L281 TraceCheckUtils]: 7: Hoare triple {983#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {983#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} is VALID [2021-09-13 14:44:38,623 INFO L281 TraceCheckUtils]: 6: Hoare triple {993#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} assume !!(main_~c~0 < main_~k~0);main_~c~0 := 1 + main_~c~0;main_~y~0 := 1 + main_~y~0;main_~x~0 := main_~y~0 * main_~y~0 * main_~y~0 + main_~x~0; {983#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 4) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 3)) (= (+ 16 (* 8 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 4 ULTIMATE.start_main_~k~0))))))} is UNKNOWN [2021-09-13 14:44:38,623 INFO L281 TraceCheckUtils]: 5: Hoare triple {993#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {993#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:44:38,623 INFO L281 TraceCheckUtils]: 4: Hoare triple {993#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} assume !false;__VERIFIER_assert_#in~cond := (if 0 == 4 * main_~x~0 - main_~y~0 * main_~y~0 * main_~y~0 * main_~y~0 - 2 * main_~y~0 * main_~y~0 * main_~y~0 - main_~y~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {993#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:44:38,624 INFO L281 TraceCheckUtils]: 3: Hoare triple {842#true} main_~y~0 := 0;main_~x~0 := 0;main_~c~0 := 0; {993#(or (not (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 4)) (= (+ (* 10 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 25) (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* 5 ULTIMATE.start_main_~k~0))) (< (+ ULTIMATE.start_main_~c~0 5) ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:44:38,624 INFO L281 TraceCheckUtils]: 2: Hoare triple {842#true} assume !(0 == assume_abort_if_not_~cond); {842#true} is VALID [2021-09-13 14:44:38,624 INFO L281 TraceCheckUtils]: 1: Hoare triple {842#true} havoc main_#res;havoc main_#t~nondet7, main_~k~0, main_~y~0, main_~x~0, main_~c~0;havoc main_~k~0;havoc main_~y~0;havoc main_~x~0;havoc main_~c~0;assume -32768 <= main_#t~nondet7 && main_#t~nondet7 <= 32767;main_~k~0 := main_#t~nondet7;havoc main_#t~nondet7;assume_abort_if_not_#in~cond := (if main_~k~0 >= 0 && main_~k~0 <= 5 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {842#true} is VALID [2021-09-13 14:44:38,624 INFO L281 TraceCheckUtils]: 0: Hoare triple {842#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(9);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {842#true} is VALID [2021-09-13 14:44:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:44:38,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:44:38,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388998340] [2021-09-13 14:44:38,625 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:44:38,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994853146] [2021-09-13 14:44:38,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994853146] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:44:38,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:44:38,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-09-13 14:44:38,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090127418] [2021-09-13 14:44:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) Word has length 25 [2021-09-13 14:44:38,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:44:38,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) [2021-09-13 14:44:54,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 40 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:54,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-09-13 14:44:54,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:44:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-09-13 14:44:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-09-13 14:44:54,193 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) [2021-09-13 14:44:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:55,818 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2021-09-13 14:44:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-09-13 14:44:55,819 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) Word has length 25 [2021-09-13 14:44:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:44:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) [2021-09-13 14:44:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2021-09-13 14:44:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) [2021-09-13 14:44:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2021-09-13 14:44:55,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 32 transitions. [2021-09-13 14:44:59,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:44:59,090 INFO L225 Difference]: With dead ends: 31 [2021-09-13 14:44:59,090 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:44:59,091 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1768.53ms TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2021-09-13 14:44:59,092 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 290.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.41ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 292.78ms IncrementalHoareTripleChecker+Time [2021-09-13 14:44:59,092 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 1.41ms Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 28 Unchecked, 292.78ms Time] [2021-09-13 14:44:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:44:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:44:59,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:44:59,093 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) [2021-09-13 14:44:59,094 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) [2021-09-13 14:44:59,094 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) [2021-09-13 14:44:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:59,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:44:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:44:59,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:59,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:59,095 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. [2021-09-13 14:44:59,095 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. [2021-09-13 14:44:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:44:59,095 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:44:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:44:59,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:59,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:44:59,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:44:59,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:44:59,096 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) [2021-09-13 14:44:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:44:59,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-09-13 14:44:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:44:59,096 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:44:59,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 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) [2021-09-13 14:44:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:44:59,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:44:59,099 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-09-13 14:44:59,099 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-09-13 14:44:59,099 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-09-13 14:44:59,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:44:59,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:44:59,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:44:59,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:44:59,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:44:59,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:44:59,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:44:59,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:44:59,979 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (or (and (= ULTIMATE.start_main_~y~0 0) (= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~c~0 0)) (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0)) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))) (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0))))) [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point L27-3(lines 27 36) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point L11-1(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point L11-2(lines 11 12) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:44:59,979 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L854 garLoopResultBuilder]: At program point L10-2(lines 30 31) the Hoare annotation is: (let ((.cse0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (or (= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) .cse0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~k~0)) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 1) ULTIMATE.start_main_~k~0) (= (+ (* 2 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) 1) (+ ULTIMATE.start_main_~k~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~c~0))) (forall ((ULTIMATE.start_main_~k~0 Int)) (or (< (+ ULTIMATE.start_main_~c~0 3) ULTIMATE.start_main_~k~0) (= (+ (* 3 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ 9 (* 6 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~c~0 2)))) (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse0 (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0)))) [2021-09-13 14:44:59,980 INFO L858 garLoopResultBuilder]: For program point L10-3(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L861 garLoopResultBuilder]: At program point L39(lines 17 40) the Hoare annotation is: true [2021-09-13 14:44:59,980 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2021-09-13 14:44:59,980 INFO L854 garLoopResultBuilder]: At program point L10-5(lines 9 15) the Hoare annotation is: (= (+ (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (* 2 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (* 4 ULTIMATE.start_main_~x~0)) [2021-09-13 14:44:59,981 INFO L858 garLoopResultBuilder]: For program point L10-6(lines 10 13) no Hoare annotation was computed. [2021-09-13 14:44:59,981 INFO L861 garLoopResultBuilder]: At program point L10-8(lines 9 15) the Hoare annotation is: true [2021-09-13 14:44:59,985 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:44:59,988 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:44:59,989 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L10-6 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:45:02,116 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:45:02,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:45:02,117 INFO L163 areAnnotationChecker]: CFG has 2 edges. 1 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:45:02,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:45:02 BoogieIcfgContainer [2021-09-13 14:45:02,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:45:02,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:45:02,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:45:02,132 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:45:02,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:44:17" (3/4) ... [2021-09-13 14:45:02,135 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:45:02,142 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-09-13 14:45:02,142 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:45:02,142 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:45:02,143 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:45:02,174 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:45:02,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:45:02,175 INFO L158 Benchmark]: Toolchain (without parser) took 45291.20ms. Allocated memory was 52.4MB in the beginning and 96.5MB in the end (delta: 44.0MB). Free memory was 29.6MB in the beginning and 29.9MB in the end (delta: -318.9kB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2021-09-13 14:45:02,175 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:45:02,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.99ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 31.0MB in the end (delta: -1.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2021-09-13 14:45:02,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.15ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 31.0MB in the beginning and 48.0MB in the end (delta: -17.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:45:02,176 INFO L158 Benchmark]: Boogie Preprocessor took 19.91ms. Allocated memory is still 65.0MB. Free memory was 48.0MB in the beginning and 46.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:45:02,176 INFO L158 Benchmark]: RCFGBuilder took 285.32ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 37.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:45:02,176 INFO L158 Benchmark]: TraceAbstraction took 44685.03ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 36.5MB in the beginning and 32.0MB in the end (delta: 4.5MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2021-09-13 14:45:02,177 INFO L158 Benchmark]: Witness Printer took 42.46ms. Allocated memory is still 96.5MB. Free memory was 32.0MB in the beginning and 29.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:45:02,179 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.17ms. Allocated memory is still 52.4MB. Free memory is still 34.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.99ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 31.0MB in the end (delta: -1.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.15ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 31.0MB in the beginning and 48.0MB in the end (delta: -17.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.91ms. Allocated memory is still 65.0MB. Free memory was 48.0MB in the beginning and 46.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.32ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 37.0MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 44685.03ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 36.5MB in the beginning and 32.0MB in the end (delta: 4.5MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Witness Printer took 42.46ms. Allocated memory is still 96.5MB. Free memory was 32.0MB in the beginning and 29.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 21 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 42478.76ms, OverallIterations: 6, TraceHistogramMax: 6, EmptinessCheckTime: 11.24ms, AutomataDifference: 6633.27ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 673.24ms, InitialAbstractionConstructionTime: 12.66ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 977.29ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 968.83ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 66 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 363 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 0 mSDtfsCounter, 363 mSolverCounterSat, 6.07ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2468.32ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 154.40ms AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 24 NumberOfFragments, 204 HoareAnnotationTreeSize, 5 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 94.99ms HoareSimplificationTime, 5 FomulaSimplificationsInter, 1006 FormulaSimplificationTreeSizeReductionInter, 569.84ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 38.56ms SsaConstructionTime, 243.04ms SatisfiabilityAnalysisTime, 16990.83ms InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 132 ConstructedInterpolants, 24 QuantifiedInterpolants, 1747 SizeOfPredicates, 26 NumberOfNonLiveVariables, 391 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 1/118 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 3 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2021-09-13 14:45:02,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: (((1 <= cond && (y * k == y * y || c < k)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 1 < ULTIMATE.start_main_~k~0 || 2 * y + y * y + 1 == ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0) || ULTIMATE.start_main_~k~0 <= c)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 3 < ULTIMATE.start_main_~k~0 || 3 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0 == 9 + 6 * y + y * y) || ULTIMATE.start_main_~k~0 <= c + 2)) && y * y * y * y + y * y + 2 * (y * y * y) == 4 * x - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: y * y * y * y + y * y + 2 * (y * y * y) == 4 * x - InvariantResult [Line: 27]: Loop Invariant [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,196 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-09-13 14:45:02,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: ((y == 0 && x == 0) && c == 0) || ((((1 <= cond && (y * k == y * y || c < k)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 1 < ULTIMATE.start_main_~k~0 || 2 * y + y * y + 1 == ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0) || ULTIMATE.start_main_~k~0 <= c)) && (forall ULTIMATE.start_main_~k~0 : int :: (c + 3 < ULTIMATE.start_main_~k~0 || 3 * ULTIMATE.start_main_~k~0 + y * ULTIMATE.start_main_~k~0 == 9 + 6 * y + y * y) || ULTIMATE.start_main_~k~0 <= c + 2)) && y * y * y * y + y * y + 2 * (y * y * y) == 4 * x) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:45:02,213 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...