./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 460c22b2298e82c93e0c779716bcc2f68b35af6e ........................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 460c22b2298e82c93e0c779716bcc2f68b35af6e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 18:51:44,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:51:44,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:51:44,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:51:44,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:51:44,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:51:44,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:51:44,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:51:44,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:51:44,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:51:44,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:51:44,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:51:44,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:51:44,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:51:44,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:51:44,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:51:44,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:51:44,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:51:44,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:51:44,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:51:44,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:51:44,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:51:44,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:51:44,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:51:44,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:51:44,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:51:44,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:51:44,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:51:44,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:51:44,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:51:44,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:51:44,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:51:44,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:51:44,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:51:44,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:51:44,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:51:44,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:51:44,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:51:44,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:51:44,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:51:44,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:51:44,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 18:51:44,768 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:51:44,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:51:44,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:51:44,770 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:51:44,770 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:51:44,770 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:51:44,770 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 18:51:44,770 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:51:44,770 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:51:44,771 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 18:51:44,771 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 18:51:44,771 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:51:44,771 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 18:51:44,771 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 18:51:44,771 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 18:51:44,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:51:44,772 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:51:44,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 18:51:44,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:51:44,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:51:44,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:51:44,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:51:44,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:51:44,773 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:51:44,774 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:51:44,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:51:44,774 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:51:44,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:51:44,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:51:44,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:51:44,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:51:44,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:51:44,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:51:44,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:51:44,775 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 18:51:44,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 18:51:44,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:51:44,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:51:44,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:51:44,776 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan 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 -> Taipan 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 -> 460c22b2298e82c93e0c779716bcc2f68b35af6e [2020-12-09 18:51:44,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:51:44,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:51:44,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:51:44,975 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:51:44,975 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:51:44,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i [2020-12-09 18:51:45,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/0376cabaa/30c522465e7249f8b2a0420b756d2e90/FLAGdc0b2afc0 [2020-12-09 18:51:45,380 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:51:45,380 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i [2020-12-09 18:51:45,385 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/0376cabaa/30c522465e7249f8b2a0420b756d2e90/FLAGdc0b2afc0 [2020-12-09 18:51:45,394 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/0376cabaa/30c522465e7249f8b2a0420b756d2e90 [2020-12-09 18:51:45,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:51:45,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:51:45,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:51:45,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:51:45,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:51:45,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:51:45" (1/1) ... [2020-12-09 18:51:45,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2a692e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:45, skipping insertion in model container [2020-12-09 18:51:45,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:51:45" (1/1) ... [2020-12-09 18:51:45,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:51:45,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:51:45,548 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i[948,961] [2020-12-09 18:51:45,559 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:846) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1710) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:234) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1402) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:707) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1353) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1046) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1424) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3213) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2293) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:580) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 18:51:45,562 INFO L168 Benchmark]: Toolchain (without parser) took 164.08 ms. Allocated memory is still 117.4 MB. Free memory was 85.4 MB in the beginning and 96.4 MB in the end (delta: -11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 18:51:45,563 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 73.4 MB. Free memory was 47.7 MB in the beginning and 47.7 MB in the end (delta: 25.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:51:45,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.43 ms. Allocated memory is still 117.4 MB. Free memory was 85.3 MB in the beginning and 96.4 MB in the end (delta: -11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 18:51:45,565 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 73.4 MB. Free memory was 47.7 MB in the beginning and 47.7 MB in the end (delta: 25.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 162.43 ms. Allocated memory is still 117.4 MB. Free memory was 85.3 MB in the beginning and 96.4 MB in the end (delta: -11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:846) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 18:51:46,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:51:46,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:51:46,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:51:46,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:51:46,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:51:46,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:51:46,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:51:46,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:51:46,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:51:46,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:51:46,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:51:46,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:51:46,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:51:46,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:51:46,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:51:46,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:51:46,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:51:46,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:51:46,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:51:46,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:51:46,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:51:46,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:51:46,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:51:46,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:51:46,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:51:46,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:51:46,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:51:46,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:51:46,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:51:46,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:51:46,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:51:46,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:51:46,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:51:46,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:51:46,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:51:46,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:51:46,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:51:46,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:51:46,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:51:46,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:51:46,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 18:51:46,989 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:51:46,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:51:46,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:51:46,990 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:51:46,990 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:51:46,991 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:51:46,991 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:51:46,991 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:51:46,991 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:51:46,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:51:46,992 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:51:46,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:51:46,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:51:46,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:51:46,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:51:46,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:51:46,993 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:51:46,993 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 18:51:46,994 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 18:51:46,994 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:51:46,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:51:46,994 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:51:46,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:51:46,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:51:46,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 18:51:46,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:51:46,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:51:46,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:51:46,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:51:46,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:51:46,996 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 18:51:46,996 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 18:51:46,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:51:46,997 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:51:46,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:51:46,997 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan 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 -> Taipan 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 -> 460c22b2298e82c93e0c779716bcc2f68b35af6e [2020-12-09 18:51:47,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:51:47,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:51:47,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:51:47,230 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:51:47,231 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:51:47,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i [2020-12-09 18:51:47,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/4b9835131/4cb263c54d3a47f3b1a0f80142f869b8/FLAG1bbdc64b8 [2020-12-09 18:51:47,652 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:51:47,653 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i [2020-12-09 18:51:47,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/4b9835131/4cb263c54d3a47f3b1a0f80142f869b8/FLAG1bbdc64b8 [2020-12-09 18:51:47,668 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/data/4b9835131/4cb263c54d3a47f3b1a0f80142f869b8 [2020-12-09 18:51:47,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:51:47,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:51:47,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:51:47,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:51:47,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:51:47,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cb4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47, skipping insertion in model container [2020-12-09 18:51:47,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:51:47,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:51:47,791 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i[948,961] [2020-12-09 18:51:47,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:51:47,824 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:51:47,840 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound20.i[948,961] [2020-12-09 18:51:47,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:51:47,872 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:51:47,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47 WrapperNode [2020-12-09 18:51:47,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:51:47,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:51:47,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:51:47,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:51:47,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:51:47,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:51:47,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:51:47,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:51:47,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... [2020-12-09 18:51:47,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:51:47,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:51:47,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:51:47,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:51:47,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:51:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 18:51:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:51:47,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:51:47,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:51:51,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:51:51,079 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-09 18:51:51,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:51:51 BoogieIcfgContainer [2020-12-09 18:51:51,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:51:51,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:51:51,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:51:51,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:51:51,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:51:47" (1/3) ... [2020-12-09 18:51:51,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b59e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:51:51, skipping insertion in model container [2020-12-09 18:51:51,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:47" (2/3) ... [2020-12-09 18:51:51,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b59e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:51:51, skipping insertion in model container [2020-12-09 18:51:51,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:51:51" (3/3) ... [2020-12-09 18:51:51,087 INFO L111 eAbstractionObserver]: Analyzing ICFG knuth_valuebound20.i [2020-12-09 18:51:51,097 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:51:51,100 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-09 18:51:51,108 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-12-09 18:51:51,124 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:51:51,124 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:51:51,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:51:51,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:51:51,124 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:51:51,124 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:51:51,124 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:51:51,124 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:51:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-12-09 18:51:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 18:51:51,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:51:51,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:51:51,137 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:51:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:51:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -144177098, now seen corresponding path program 1 times [2020-12-09 18:51:51,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:51:51,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453080868] [2020-12-09 18:51:51,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 18:51:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:51:51,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-09 18:51:51,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:51:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:51:51,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:51:51,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453080868] [2020-12-09 18:51:51,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:51:51,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 18:51:51,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648241490] [2020-12-09 18:51:51,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-09 18:51:51,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:51:51,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-09 18:51:51,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 18:51:51,483 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-12-09 18:51:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:51:51,495 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2020-12-09 18:51:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 18:51:51,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-12-09 18:51:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:51:51,501 INFO L225 Difference]: With dead ends: 65 [2020-12-09 18:51:51,502 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 18:51:51,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 18:51:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 18:51:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-12-09 18:51:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 18:51:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-12-09 18:51:51,526 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2020-12-09 18:51:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:51:51,526 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-12-09 18:51:51,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-09 18:51:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-12-09 18:51:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 18:51:51,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:51:51,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:51:51,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 18:51:51,728 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:51:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:51:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1281167042, now seen corresponding path program 1 times [2020-12-09 18:51:51,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:51:51,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628307421] [2020-12-09 18:51:51,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 18:51:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:51:53,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 18:51:53,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:51:53,942 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2020-12-09 18:51:54,496 WARN L197 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2020-12-09 18:51:54,946 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-09 18:51:56,656 WARN L197 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 18:51:56,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 18:51:56,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:51:56,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:52:12,685 WARN L197 SmtUtils]: Spent 9.34 s on a formula simplification that was a NOOP. DAG size: 45 [2020-12-09 18:52:18,794 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (and (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule ULTIMATE.start_main_~d~0 (_ bv20 32)) (not (= (bvmul (_ bv8 32) ULTIMATE.start_main_~n~0) (let ((.cse3 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (let ((.cse2 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (.cse1 (bvudiv ULTIMATE.start_main_~n~0 .cse3)) (.cse0 (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)))) (bvadd (bvneg (bvmul (bvadd (bvmul .cse0 (_ bv8 32)) (bvmul .cse1 (_ bv8 32))) ULTIMATE.start_main_~d~0)) (bvneg (bvmul (bvmul .cse2 (_ bv4 32)) ULTIMATE.start_main_~d~0)) (bvmul (_ bv8 32) .cse2) (bvmul (_ bv4 32) (bvmul .cse1 ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~d~0)) (bvmul (_ bv4 32) (bvmul .cse0 ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~d~0)) (bvmul (_ bv4 32) (bvmul ULTIMATE.start_main_~d~0 (bvurem ULTIMATE.start_main_~n~0 .cse3)))))))) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32)))) is different from false [2020-12-09 18:52:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:52:20,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:52:20,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628307421] [2020-12-09 18:52:20,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:52:20,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 18:52:20,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776669772] [2020-12-09 18:52:20,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 18:52:20,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:52:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 18:52:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2020-12-09 18:52:20,713 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 11 states. [2020-12-09 18:52:21,349 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2020-12-09 18:52:21,983 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2020-12-09 18:52:26,873 WARN L197 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2020-12-09 18:52:42,535 WARN L197 SmtUtils]: Spent 9.77 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2020-12-09 18:53:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:53:06,705 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-12-09 18:53:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 18:53:06,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-12-09 18:53:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:53:06,724 INFO L225 Difference]: With dead ends: 50 [2020-12-09 18:53:06,725 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 18:53:06,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=52, Invalid=133, Unknown=1, NotChecked=24, Total=210 [2020-12-09 18:53:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 18:53:06,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2020-12-09 18:53:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 18:53:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-12-09 18:53:06,732 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2020-12-09 18:53:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:53:06,732 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-12-09 18:53:06,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 18:53:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-12-09 18:53:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 18:53:06,733 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:53:06,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:53:06,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 18:53:06,935 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:53:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:53:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1454243009, now seen corresponding path program 1 times [2020-12-09 18:53:06,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:53:06,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143799470] [2020-12-09 18:53:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 18:53:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:53:07,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 18:53:07,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:53:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:53:07,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:53:07,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143799470] [2020-12-09 18:53:07,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:53:07,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 18:53:07,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898981763] [2020-12-09 18:53:07,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:53:07,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:53:07,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:53:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:53:07,384 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2020-12-09 18:53:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:53:08,579 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-12-09 18:53:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 18:53:08,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 18:53:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:53:08,592 INFO L225 Difference]: With dead ends: 48 [2020-12-09 18:53:08,592 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 18:53:08,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 18:53:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 18:53:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-12-09 18:53:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 18:53:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-12-09 18:53:08,598 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 15 [2020-12-09 18:53:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:53:08,598 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-12-09 18:53:08,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:53:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-12-09 18:53:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 18:53:08,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:53:08,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:53:08,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 18:53:08,801 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:53:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:53:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1663317220, now seen corresponding path program 1 times [2020-12-09 18:53:08,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:53:08,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737663248] [2020-12-09 18:53:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 18:53:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:53:12,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 18:53:12,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:53:12,834 WARN L197 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2020-12-09 18:53:13,563 WARN L197 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2020-12-09 18:53:14,166 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-09 18:53:14,424 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-09 18:53:16,440 WARN L197 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 30 [2020-12-09 18:53:31,024 WARN L197 SmtUtils]: Spent 12.50 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-09 18:53:41,299 WARN L197 SmtUtils]: Spent 3.93 s on a formula simplification that was a NOOP. DAG size: 44 [2020-12-09 18:53:41,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:53:41,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:53:41,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 18:54:01,565 WARN L197 SmtUtils]: Spent 10.48 s on a formula simplification that was a NOOP. DAG size: 58 [2020-12-09 18:54:07,704 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~a~0 (_ BitVec 32))) (let ((.cse7 (bvadd ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (let ((.cse3 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~a~0)) (.cse4 (bvudiv ULTIMATE.start_main_~n~0 .cse7)) (.cse5 (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~a~0)))) (let ((.cse0 (bvmul (_ bv4 32) (bvmul .cse5 ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~a~0))) (.cse1 (bvmul (_ bv4 32) (bvmul .cse4 ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~a~0))) (.cse2 (bvmul (_ bv8 32) .cse3)) (.cse6 (bvmul (_ bv4 32) (bvmul (bvurem ULTIMATE.start_main_~n~0 .cse7) ULTIMATE.start_main_~a~0)))) (and (= (bvmul (_ bv8 32) ULTIMATE.start_main_~n~0) (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul (bvmul .cse3 (_ bv4 32)) ULTIMATE.start_main_~a~0)) (bvneg (bvmul (bvadd (bvmul .cse4 (_ bv8 32)) (bvmul .cse5 (_ bv8 32))) ULTIMATE.start_main_~a~0)) .cse6)) (not (= (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul ULTIMATE.start_main_~n~0 (_ bv8 32))) (bvneg (bvmul (bvmul ULTIMATE.start_main_~a~0 (_ bv2 32)) (bvadd (bvmul .cse4 (_ bv4 32)) (bvmul .cse5 (_ bv4 32))))) (bvneg (bvmul (bvmul ULTIMATE.start_main_~a~0 (_ bv4 32)) .cse3)) .cse6) (_ bv0 32))) (bvule ULTIMATE.start_main_~a~0 (_ bv20 32)) (bvugt ULTIMATE.start_main_~a~0 (_ bv2 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))))) is different from false [2020-12-09 18:54:09,734 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~a~0 (_ BitVec 32))) (let ((.cse7 (bvadd ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (let ((.cse3 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~a~0)) (.cse4 (bvudiv ULTIMATE.start_main_~n~0 .cse7)) (.cse5 (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~a~0)))) (let ((.cse0 (bvmul (_ bv4 32) (bvmul .cse5 ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~a~0))) (.cse1 (bvmul (_ bv4 32) (bvmul .cse4 ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~a~0))) (.cse2 (bvmul (_ bv8 32) .cse3)) (.cse6 (bvmul (_ bv4 32) (bvmul (bvurem ULTIMATE.start_main_~n~0 .cse7) ULTIMATE.start_main_~a~0)))) (and (= (bvmul (_ bv8 32) ULTIMATE.start_main_~n~0) (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul (bvmul .cse3 (_ bv4 32)) ULTIMATE.start_main_~a~0)) (bvneg (bvmul (bvadd (bvmul .cse4 (_ bv8 32)) (bvmul .cse5 (_ bv8 32))) ULTIMATE.start_main_~a~0)) .cse6)) (not (= (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul ULTIMATE.start_main_~n~0 (_ bv8 32))) (bvneg (bvmul (bvmul ULTIMATE.start_main_~a~0 (_ bv2 32)) (bvadd (bvmul .cse4 (_ bv4 32)) (bvmul .cse5 (_ bv4 32))))) (bvneg (bvmul (bvmul ULTIMATE.start_main_~a~0 (_ bv4 32)) .cse3)) .cse6) (_ bv0 32))) (bvule ULTIMATE.start_main_~a~0 (_ bv20 32)) (bvugt ULTIMATE.start_main_~a~0 (_ bv2 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))))) is different from true [2020-12-09 18:54:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:54:09,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:54:09,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737663248] [2020-12-09 18:54:09,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:54:09,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 18:54:09,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023434233] [2020-12-09 18:54:09,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 18:54:09,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:54:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 18:54:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=90, Unknown=6, NotChecked=20, Total=156 [2020-12-09 18:54:09,739 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 13 states. [2020-12-09 18:54:11,215 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2020-12-09 18:54:12,369 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2020-12-09 18:54:19,152 WARN L197 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2020-12-09 18:54:48,337 WARN L197 SmtUtils]: Spent 19.80 s on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-12-09 18:55:16,361 WARN L197 SmtUtils]: Spent 18.20 s on a formula simplification that was a NOOP. DAG size: 90 [2020-12-09 18:55:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:55:52,013 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2020-12-09 18:55:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 18:55:52,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-12-09 18:55:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:55:52,036 INFO L225 Difference]: With dead ends: 46 [2020-12-09 18:55:52,036 INFO L226 Difference]: Without dead ends: 44 [2020-12-09 18:55:52,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 95.5s TimeCoverageRelationStatistics Valid=79, Invalid=189, Unknown=8, NotChecked=30, Total=306 [2020-12-09 18:55:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-12-09 18:55:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2020-12-09 18:55:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 18:55:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-12-09 18:55:52,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 17 [2020-12-09 18:55:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:55:52,045 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-12-09 18:55:52,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 18:55:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-12-09 18:55:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 18:55:52,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:55:52,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:55:52,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 18:55:52,248 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:55:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:55:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 720171431, now seen corresponding path program 1 times [2020-12-09 18:55:52,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:55:52,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771727553] [2020-12-09 18:55:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 18:55:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:55:54,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 18:55:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:55:54,606 WARN L197 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2020-12-09 18:55:55,366 WARN L197 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2020-12-09 18:55:56,013 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-09 18:55:56,286 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-09 18:55:58,557 WARN L197 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 30 [2020-12-09 18:55:58,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:56:47,830 WARN L197 SmtUtils]: Spent 46.59 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2020-12-09 18:56:54,454 WARN L197 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 44 [2020-12-09 18:56:54,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 18:56:54,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 18:56:54,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 18:56:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:56:57,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 18:56:57,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771727553] [2020-12-09 18:56:57,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:56:57,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 18:56:57,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839260325] [2020-12-09 18:56:57,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 18:56:57,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:56:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 18:56:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=99, Unknown=3, NotChecked=0, Total=132 [2020-12-09 18:56:57,152 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 12 states. [2020-12-09 18:56:57,790 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2020-12-09 18:56:58,530 WARN L197 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2020-12-09 18:56:59,702 WARN L197 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2020-12-09 18:57:55,470 WARN L197 SmtUtils]: Spent 39.86 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2020-12-09 18:58:13,385 WARN L197 SmtUtils]: Spent 14.51 s on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2020-12-09 18:58:28,109 WARN L197 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 51 [2020-12-09 18:58:36,140 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-09 18:58:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:58:44,454 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2020-12-09 18:58:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 18:58:44,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-09 18:58:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:58:44,457 INFO L225 Difference]: With dead ends: 45 [2020-12-09 18:58:44,457 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 18:58:44,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 140.6s TimeCoverageRelationStatistics Valid=83, Invalid=251, Unknown=8, NotChecked=0, Total=342 [2020-12-09 18:58:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 18:58:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-12-09 18:58:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 18:58:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2020-12-09 18:58:44,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2020-12-09 18:58:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:58:44,465 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-12-09 18:58:44,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 18:58:44,465 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-12-09 18:58:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 18:58:44,466 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:58:44,466 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:58:44,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 18:58:44,667 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:58:44,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:58:44,668 INFO L82 PathProgramCache]: Analyzing trace with hash 729574747, now seen corresponding path program 1 times [2020-12-09 18:58:44,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:58:44,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300418092] [2020-12-09 18:58:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 18:58:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:58:45,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 18:58:45,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:58:46,087 WARN L197 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 18:58:47,110 WARN L197 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 18:58:47,361 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 18:58:47,916 WARN L197 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 18:58:48,274 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 18:58:50,711 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32))) is different from false [2020-12-09 18:58:53,270 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (let ((.cse0 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0))) is different from false [2020-12-09 18:59:00,650 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0))) (and (not (= (_ bv0 32) .cse0)) (let ((.cse1 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvurem ULTIMATE.start_main_~n~0 .cse1))) (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from false [2020-12-09 18:59:02,981 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0))) (and (not (= (_ bv0 32) .cse0)) (let ((.cse1 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvurem ULTIMATE.start_main_~n~0 .cse1))) (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from true [2020-12-09 18:59:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 18:59:12,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:59:13,406 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-09 18:59:15,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 18:59:18,329 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 18:59:20,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 18:59:23,319 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 18:59:23,326 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 18:59:23,326 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:59:25,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 18:59:28,268 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 18:59:30,727 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 18:59:33,198 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 18:59:33,208 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 18:59:33,208 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:59:35,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_9)) (= (_ bv0 32) .cse0) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from false [2020-12-09 18:59:38,127 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_9)) (= (_ bv0 32) .cse0) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from true [2020-12-09 18:59:40,639 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_9)) (= (_ bv0 32) .cse0) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-09 18:59:40,649 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 18:59:40,649 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:59:43,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_10 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9))) (or (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~n~0_10 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_10 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_10 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem v_ULTIMATE.start_main_~n~0_10 .cse1)))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_10))) v_ULTIMATE.start_main_~a~0_9)) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from false [2020-12-09 18:59:45,484 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_10 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9))) (or (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~n~0_10 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_10 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_10 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem v_ULTIMATE.start_main_~n~0_10 .cse1)))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_10))) v_ULTIMATE.start_main_~a~0_9)) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from true [2020-12-09 18:59:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:59:45,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300418092] [2020-12-09 18:59:45,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 18:59:45,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2020-12-09 18:59:45,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44130090] [2020-12-09 18:59:45,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 18:59:45,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 18:59:45,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 18:59:45,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 18:59:45,492 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2020-12-09 18:59:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:59:47,216 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-12-09 18:59:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 18:59:47,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-12-09 18:59:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:59:47,218 INFO L225 Difference]: With dead ends: 60 [2020-12-09 18:59:47,218 INFO L226 Difference]: Without dead ends: 40 [2020-12-09 18:59:47,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 18:59:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-09 18:59:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-12-09 18:59:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 18:59:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-12-09 18:59:47,227 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 23 [2020-12-09 18:59:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:59:47,227 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-12-09 18:59:47,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 18:59:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-12-09 18:59:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 18:59:47,228 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:59:47,228 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:59:47,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 18:59:47,430 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:59:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:59:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1145493114, now seen corresponding path program 1 times [2020-12-09 18:59:47,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 18:59:47,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771138471] [2020-12-09 18:59:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 18:59:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:59:48,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 18:59:48,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:59:49,073 WARN L197 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 18:59:49,295 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-12-09 18:59:50,312 WARN L197 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 18:59:50,632 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 18:59:51,294 WARN L197 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 18:59:51,712 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 18:59:54,243 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32))) is different from false [2020-12-09 18:59:56,810 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32))) is different from false [2020-12-09 19:00:04,281 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~d~0_22 (_ BitVec 32)) (ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22))) (and (bvugt v_ULTIMATE.start_main_~d~0_22 (_ bv2 32)) (not (= (_ bv0 32) .cse0)) (bvule v_ULTIMATE.start_main_~d~0_22 (_ bv20 32)) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_22 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22)) (_ bv4 32))) (bvadd v_ULTIMATE.start_main_~d~0_22 (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv2 32)))) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_22) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from false [2020-12-09 19:00:06,629 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~d~0_22 (_ BitVec 32)) (ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22))) (and (bvugt v_ULTIMATE.start_main_~d~0_22 (_ bv2 32)) (not (= (_ bv0 32) .cse0)) (bvule v_ULTIMATE.start_main_~d~0_22 (_ bv20 32)) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_22 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22)) (_ bv4 32))) (bvadd v_ULTIMATE.start_main_~d~0_22 (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv2 32)))) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_22) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from true [2020-12-09 19:00:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 19:00:16,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:00:17,293 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-09 19:00:19,807 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from false [2020-12-09 19:00:22,256 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from true [2020-12-09 19:00:24,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-12-09 19:00:27,211 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-12-09 19:00:27,216 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 19:00:27,217 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:00:29,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from false [2020-12-09 19:00:32,204 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from true [2020-12-09 19:00:34,744 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-12-09 19:00:37,202 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-12-09 19:00:37,209 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:00:37,209 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:00:39,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_11)) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv20 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (= (_ bv0 32) .cse0)))) is different from false [2020-12-09 19:00:42,145 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_11)) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv20 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (= (_ bv0 32) .cse0)))) is different from true [2020-12-09 19:00:44,653 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_11)) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv20 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (= (_ bv0 32) .cse0)))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-09 19:00:44,662 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:00:44,662 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:00:47,036 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvuge v_ULTIMATE.start_main_~n~0_11 (_ bv0 32))) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (= .cse0 (_ bv0 32)) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv20 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_11 .cse1) (_ bv4 32))) (bvadd (bvurem v_ULTIMATE.start_main_~n~0_11 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (not (bvule v_ULTIMATE.start_main_~n~0_11 (_ bv20 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_11))) v_ULTIMATE.start_main_~a~0_11))))) is different from false [2020-12-09 19:00:49,511 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvuge v_ULTIMATE.start_main_~n~0_11 (_ bv0 32))) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (= .cse0 (_ bv0 32)) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv20 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_11 .cse1) (_ bv4 32))) (bvadd (bvurem v_ULTIMATE.start_main_~n~0_11 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (not (bvule v_ULTIMATE.start_main_~n~0_11 (_ bv20 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_11))) v_ULTIMATE.start_main_~a~0_11))))) is different from true [2020-12-09 19:00:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:00:49,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771138471] [2020-12-09 19:00:49,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:00:49,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2020-12-09 19:00:49,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609175838] [2020-12-09 19:00:49,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 19:00:49,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:00:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 19:00:49,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 19:00:49,518 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2020-12-09 19:00:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:00:51,600 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-12-09 19:00:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:00:51,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-09 19:00:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:00:51,605 INFO L225 Difference]: With dead ends: 62 [2020-12-09 19:00:51,605 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 19:00:51,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 19:00:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 19:00:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-12-09 19:00:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 19:00:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-12-09 19:00:51,614 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2020-12-09 19:00:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:00:51,615 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-12-09 19:00:51,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 19:00:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-12-09 19:00:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 19:00:51,615 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:00:51,616 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:00:51,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 19:00:51,817 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:00:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:00:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1154209558, now seen corresponding path program 1 times [2020-12-09 19:00:51,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:00:51,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971773056] [2020-12-09 19:00:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 19:00:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:00:52,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 19:00:52,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:00:53,468 WARN L197 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 19:00:53,694 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-12-09 19:00:54,763 WARN L197 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 19:00:55,078 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 19:00:55,795 WARN L197 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 19:00:56,256 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 19:00:58,727 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32))) is different from false [2020-12-09 19:01:01,284 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32))) is different from false [2020-12-09 19:01:08,743 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~d~0_26 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26))) (and (bvule v_ULTIMATE.start_main_~d~0_26 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_26) (bvugt v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (not (= .cse0 (_ bv0 32))) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_26 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvmul v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from false [2020-12-09 19:01:11,118 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~d~0_26 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26))) (and (bvule v_ULTIMATE.start_main_~d~0_26 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_26) (bvugt v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (not (= .cse0 (_ bv0 32))) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_26 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvmul v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))) (bvule ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from true [2020-12-09 19:01:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 19:01:21,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:01:21,852 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-09 19:01:24,399 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 19:01:26,878 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 19:01:29,418 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 19:01:31,876 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 19:01:31,880 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 19:01:31,881 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:34,359 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 19:01:36,816 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 19:01:39,374 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 19:01:41,841 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 19:01:41,847 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:41,848 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:44,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_13)) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))))))) is different from false [2020-12-09 19:01:46,797 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_13)) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))))))) is different from true [2020-12-09 19:01:49,322 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_13)) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-09 19:01:49,330 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:49,330 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:51,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_12 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13))) (or (= .cse0 (_ bv0 32)) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_12 (_ bv0 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_12))) v_ULTIMATE.start_main_~a~0_13)) (not (bvule v_ULTIMATE.start_main_~n~0_12 (_ bv20 32))) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32)))))))) is different from false [2020-12-09 19:01:54,230 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_12 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13))) (or (= .cse0 (_ bv0 32)) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv20 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_12 (_ bv0 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_12))) v_ULTIMATE.start_main_~a~0_13)) (not (bvule v_ULTIMATE.start_main_~n~0_12 (_ bv20 32))) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32)))))))) is different from true [2020-12-09 19:01:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:01:54,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971773056] [2020-12-09 19:01:54,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:01:54,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2020-12-09 19:01:54,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754153669] [2020-12-09 19:01:54,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 19:01:54,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:01:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 19:01:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 19:01:54,238 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2020-12-09 19:01:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:01:56,551 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-12-09 19:01:56,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 19:01:56,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-12-09 19:01:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:01:56,558 INFO L225 Difference]: With dead ends: 62 [2020-12-09 19:01:56,558 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 19:01:56,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 19:01:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 19:01:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-12-09 19:01:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 19:01:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-12-09 19:01:56,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2020-12-09 19:01:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:01:56,568 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-12-09 19:01:56,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 19:01:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-12-09 19:01:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 19:01:56,569 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:01:56,569 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:01:56,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 19:01:56,771 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:01:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:01:56,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1154269140, now seen corresponding path program 1 times [2020-12-09 19:01:56,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:01:56,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629535683] [2020-12-09 19:01:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 19:01:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:01:57,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 19:01:57,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:01:58,405 WARN L197 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 19:01:58,638 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-12-09 19:01:59,742 WARN L197 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 19:02:00,014 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 19:02:00,701 WARN L197 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 19:02:01,152 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 19:02:03,656 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv20 32)))) is different from false [2020-12-09 19:02:06,146 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv20 32)))) is different from true [2020-12-09 19:02:08,645 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule c_ULTIMATE.start_main_~n~0 (_ bv20 32)))) is different from false [2020-12-09 19:02:11,123 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv20 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule c_ULTIMATE.start_main_~n~0 (_ bv20 32)))) is different from true [2020-12-09 19:02:13,617 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32))) (.cse2 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967292 32)))) (let ((.cse0 (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse2))) (.cse1 (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 .cse3))))) (and (= (bvadd c_ULTIMATE.start_main_~r~0 (_ bv4 32)) (bvadd (bvneg (bvadd (bvmul c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (_ bv4294967292 32))) .cse0 (bvmul (_ bv2 32) c_ULTIMATE.start_main_~k~0) .cse1 (bvneg (bvurem c_ULTIMATE.start_main_~n~0 .cse2)))) (bvugt .cse3 (_ bv2 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) .cse3) (bvule .cse3 (_ bv20 32)) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse3)) (= (bvadd c_ULTIMATE.start_main_~q~0 (_ bv8 32)) (bvadd .cse0 .cse1)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~k~0)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from false [2020-12-09 19:02:16,093 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32))) (.cse2 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967292 32)))) (let ((.cse0 (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse2))) (.cse1 (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 .cse3))))) (and (= (bvadd c_ULTIMATE.start_main_~r~0 (_ bv4 32)) (bvadd (bvneg (bvadd (bvmul c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (_ bv4294967292 32))) .cse0 (bvmul (_ bv2 32) c_ULTIMATE.start_main_~k~0) .cse1 (bvneg (bvurem c_ULTIMATE.start_main_~n~0 .cse2)))) (bvugt .cse3 (_ bv2 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) .cse3) (bvule .cse3 (_ bv20 32)) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse3)) (= (bvadd c_ULTIMATE.start_main_~q~0 (_ bv8 32)) (bvadd .cse0 .cse1)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~k~0)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv20 32))))) is different from true [2020-12-09 19:02:16,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 19:02:16,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 19:02:16,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 19:02:28,618 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-09 19:02:28,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629535683] [2020-12-09 19:02:28,619 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-12-09 19:02:28,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [754882770] [2020-12-09 19:02:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:02:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:02:35,053 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 19:02:35,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:02:35,055 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-12-09 19:02:35,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879467652] [2020-12-09 19:02:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2b213c4b-2594-44ae-b53b-519373270fc2/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:02:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:02:54,529 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-09 19:02:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:02:54,531 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-12-09 19:02:54,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:02:54,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-09 19:02:54,531 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-12-09 19:02:54,531 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 19:02:55,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt [2020-12-09 19:02:55,151 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-09 19:02:55,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:02:55 BoogieIcfgContainer [2020-12-09 19:02:55,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:02:55,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:02:55,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:02:55,152 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:02:55,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:51:51" (3/4) ... [2020-12-09 19:02:55,155 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 19:02:55,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:02:55,155 INFO L168 Benchmark]: Toolchain (without parser) took 667484.46 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 35.9 MB in the beginning and 23.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:02:55,156 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 39.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:02:55,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.89 ms. Allocated memory is still 56.6 MB. Free memory was 35.7 MB in the beginning and 39.0 MB in the end (delta: -3.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:02:55,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 37.1 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:02:55,157 INFO L168 Benchmark]: Boogie Preprocessor took 22.08 ms. Allocated memory is still 56.6 MB. Free memory was 37.1 MB in the beginning and 35.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:02:55,158 INFO L168 Benchmark]: RCFGBuilder took 3155.84 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 35.5 MB in the beginning and 47.7 MB in the end (delta: -12.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:02:55,158 INFO L168 Benchmark]: TraceAbstraction took 664069.41 ms. Allocated memory is still 71.3 MB. Free memory was 47.4 MB in the beginning and 24.0 MB in the end (delta: 23.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2020-12-09 19:02:55,158 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 71.3 MB. Free memory is still 23.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:02:55,161 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 39.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 200.89 ms. Allocated memory is still 56.6 MB. Free memory was 35.7 MB in the beginning and 39.0 MB in the end (delta: -3.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.91 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 37.1 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.08 ms. Allocated memory is still 56.6 MB. Free memory was 37.1 MB in the beginning and 35.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3155.84 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 35.5 MB in the beginning and 47.7 MB in the end (delta: -12.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 664069.41 ms. Allocated memory is still 71.3 MB. Free memory was 47.4 MB in the beginning and 24.0 MB in the end (delta: 23.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.92 ms. Allocated memory is still 71.3 MB. Free memory is still 23.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L27] unsigned n, a; [L28] unsigned r, k, q, d, s, t; [L29] n = __VERIFIER_nondet_uint() [L16] COND FALSE !(!cond) [L31] a = __VERIFIER_nondet_uint() [L16] COND FALSE !(!cond) [L16] COND FALSE !(!cond) [L16] COND FALSE !(!cond) [L35] d = a [L36] r = n % d [L37] t = 0 [L38] k = n % (d - 2) [L39] q = 4 * (n / (d - 2) - n / d) [L40] s = sqrt(n) [L41] COND TRUE 1 [L19] COND FALSE !(!(cond)) [L19] COND FALSE !(!(cond)) [L19] COND FALSE !(!(cond)) [L19] COND FALSE !(!(cond)) [L46] COND FALSE !(!((s >= d) && (r != 0))) [L47] COND FALSE !(2 * r + q < k) [L53] COND FALSE !((2 * r + q >= k) && (2 * r + q < d + k + 2)) [L58] COND FALSE !((2 * r + q >= k) && (2 * r + q >= d + k + 2) && (2 * r + q < 2 * d + k + 4)) [L65] t = r [L66] r = 2 * r - k + q - 2 * d - 4 [L67] k = t [L68] q = q - 8 [L69] d = d + 2 [L41] COND TRUE 1 [L19] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 664.0s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 262.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 148 SDtfs, 206 SDslu, 319 SDs, 0 SdLazy, 554 SolverSat, 62 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 118.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 32 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 406.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 9.1s SatisfiabilityAnalysisTime, 331.3s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 210 ConstructedInterpolants, 61 QuantifiedInterpolants, 133199 SizeOfPredicates, 83 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6/12 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...