./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47ed977f76c934f7398d12ebfeb1101009979bf5 ............................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47ed977f76c934f7398d12ebfeb1101009979bf5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 19:26:16,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 19:26:16,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 19:26:16,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 19:26:16,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 19:26:16,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 19:26:16,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 19:26:16,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 19:26:16,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 19:26:16,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 19:26:16,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 19:26:16,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 19:26:16,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 19:26:16,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 19:26:16,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 19:26:16,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 19:26:16,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 19:26:16,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 19:26:16,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 19:26:16,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 19:26:16,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 19:26:16,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 19:26:16,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 19:26:16,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 19:26:16,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 19:26:16,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 19:26:16,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 19:26:16,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 19:26:16,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 19:26:16,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 19:26:16,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 19:26:16,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 19:26:16,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 19:26:16,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 19:26:16,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 19:26:16,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 19:26:16,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 19:26:16,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 19:26:16,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 19:26:16,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 19:26:16,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 19:26:16,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 19:26:16,836 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 19:26:16,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 19:26:16,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 19:26:16,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 19:26:16,838 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 19:26:16,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 19:26:16,839 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 19:26:16,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 19:26:16,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 19:26:16,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 19:26:16,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 19:26:16,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 19:26:16,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 19:26:16,841 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 19:26:16,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 19:26:16,842 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 19:26:16,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 19:26:16,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 19:26:16,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 19:26:16,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 19:26:16,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 19:26:16,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 19:26:16,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 19:26:16,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 19:26:16,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 19:26:16,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 19:26:16,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 19:26:16,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 19:26:16,846 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 19:26:16,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47ed977f76c934f7398d12ebfeb1101009979bf5 [2020-12-02 19:26:17,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 19:26:17,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 19:26:17,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 19:26:17,245 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 19:26:17,246 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 19:26:17,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-12-02 19:26:17,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4cb6499/38517554177143dcab7ba449b93c88dd/FLAG2129e66ac [2020-12-02 19:26:18,037 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 19:26:18,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-12-02 19:26:18,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4cb6499/38517554177143dcab7ba449b93c88dd/FLAG2129e66ac [2020-12-02 19:26:18,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4cb6499/38517554177143dcab7ba449b93c88dd [2020-12-02 19:26:18,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 19:26:18,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 19:26:18,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 19:26:18,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 19:26:18,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 19:26:18,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229567e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18, skipping insertion in model container [2020-12-02 19:26:18,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,426 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 19:26:18,442 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 19:26:18,675 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2020-12-02 19:26:18,681 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:26:18,692 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 19:26:18,708 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2020-12-02 19:26:18,710 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:26:18,726 INFO L217 MainTranslator]: Completed translation [2020-12-02 19:26:18,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18 WrapperNode [2020-12-02 19:26:18,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 19:26:18,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 19:26:18,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 19:26:18,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 19:26:18,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 19:26:18,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 19:26:18,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 19:26:18,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 19:26:18,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... [2020-12-02 19:26:18,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 19:26:18,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 19:26:18,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 19:26:18,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 19:26:18,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 19:26:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 19:26:18,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 19:26:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 19:26:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 19:26:19,080 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 19:26:19,081 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-02 19:26:19,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:19 BoogieIcfgContainer [2020-12-02 19:26:19,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 19:26:19,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 19:26:19,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 19:26:19,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 19:26:19,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:26:18" (1/3) ... [2020-12-02 19:26:19,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8c5ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:26:19, skipping insertion in model container [2020-12-02 19:26:19,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:18" (2/3) ... [2020-12-02 19:26:19,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8c5ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:26:19, skipping insertion in model container [2020-12-02 19:26:19,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:19" (3/3) ... [2020-12-02 19:26:19,093 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2020-12-02 19:26:19,110 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 19:26:19,113 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 19:26:19,127 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 19:26:19,156 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 19:26:19,157 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 19:26:19,157 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 19:26:19,157 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 19:26:19,157 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 19:26:19,158 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 19:26:19,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 19:26:19,158 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 19:26:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-02 19:26:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-02 19:26:19,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:26:19,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-02 19:26:19,184 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:26:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:26:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-02 19:26:19,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 19:26:19,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736011038] [2020-12-02 19:26:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 19:26:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 19:26:19,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 19:26:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 19:26:19,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 19:26:19,494 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 19:26:19,495 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 19:26:19,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 19:26:19,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:26:19 BoogieIcfgContainer [2020-12-02 19:26:19,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 19:26:19,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 19:26:19,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 19:26:19,539 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 19:26:19,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:19" (3/4) ... [2020-12-02 19:26:19,545 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 19:26:19,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 19:26:19,550 INFO L168 Benchmark]: Toolchain (without parser) took 1144.71 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 20.1 MB in the beginning and 32.5 MB in the end (delta: -12.5 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-12-02 19:26:19,554 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 41.9 MB. Free memory was 22.2 MB in the beginning and 22.2 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:26:19,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.63 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 21.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-12-02 19:26:19,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 41.9 MB. Free memory was 21.7 MB in the beginning and 20.4 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:26:19,559 INFO L168 Benchmark]: Boogie Preprocessor took 20.04 ms. Allocated memory is still 41.9 MB. Free memory was 20.4 MB in the beginning and 19.5 MB in the end (delta: 895.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 19:26:19,560 INFO L168 Benchmark]: RCFGBuilder took 292.41 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 19.4 MB in the beginning and 31.1 MB in the end (delta: -11.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-12-02 19:26:19,562 INFO L168 Benchmark]: TraceAbstraction took 450.31 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 32.7 MB in the end (delta: -2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:26:19,562 INFO L168 Benchmark]: Witness Printer took 8.01 ms. Allocated memory is still 54.5 MB. Free memory was 32.7 MB in the beginning and 32.5 MB in the end (delta: 231.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:26:19,579 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.28 ms. Allocated memory is still 41.9 MB. Free memory was 22.2 MB in the beginning and 22.2 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 322.63 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 21.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.88 ms. Allocated memory is still 41.9 MB. Free memory was 21.7 MB in the beginning and 20.4 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.04 ms. Allocated memory is still 41.9 MB. Free memory was 20.4 MB in the beginning and 19.5 MB in the end (delta: 895.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 292.41 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 19.4 MB in the beginning and 31.1 MB in the end (delta: -11.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 450.31 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 32.7 MB in the end (delta: -2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 8.01 ms. Allocated memory is still 54.5 MB. Free memory was 32.7 MB in the beginning and 32.5 MB in the end (delta: 231.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 10, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double main__x1 = main__x / 1.6; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L27] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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... ### Bit-precise run ### This is Ultimate 0.2.0-2880296 [2020-12-02 19:26:22,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 19:26:22,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 19:26:22,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 19:26:22,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 19:26:22,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 19:26:22,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 19:26:22,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 19:26:22,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 19:26:22,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 19:26:22,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 19:26:22,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 19:26:22,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 19:26:22,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 19:26:22,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 19:26:22,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 19:26:22,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 19:26:22,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 19:26:22,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 19:26:22,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 19:26:22,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 19:26:22,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 19:26:22,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 19:26:22,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 19:26:22,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 19:26:22,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 19:26:22,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 19:26:22,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 19:26:22,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 19:26:22,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 19:26:22,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 19:26:22,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 19:26:22,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 19:26:22,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 19:26:22,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 19:26:22,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 19:26:22,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 19:26:22,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 19:26:22,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 19:26:22,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 19:26:22,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 19:26:22,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 19:26:22,232 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 19:26:22,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 19:26:22,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 19:26:22,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 19:26:22,235 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 19:26:22,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 19:26:22,236 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 19:26:22,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 19:26:22,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 19:26:22,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 19:26:22,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 19:26:22,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 19:26:22,237 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 19:26:22,237 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 19:26:22,238 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 19:26:22,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 19:26:22,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 19:26:22,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 19:26:22,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 19:26:22,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 19:26:22,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 19:26:22,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 19:26:22,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 19:26:22,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 19:26:22,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 19:26:22,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 19:26:22,241 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 19:26:22,242 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 19:26:22,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 19:26:22,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 19:26:22,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 19:26:22,243 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47ed977f76c934f7398d12ebfeb1101009979bf5 [2020-12-02 19:26:22,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 19:26:22,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 19:26:22,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 19:26:22,640 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 19:26:22,643 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 19:26:22,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-12-02 19:26:22,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bbd2a05/e01b9b66581d40ada5e4cd3d84677e30/FLAGe0694605f [2020-12-02 19:26:23,308 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 19:26:23,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c [2020-12-02 19:26:23,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bbd2a05/e01b9b66581d40ada5e4cd3d84677e30/FLAGe0694605f [2020-12-02 19:26:23,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7bbd2a05/e01b9b66581d40ada5e4cd3d84677e30 [2020-12-02 19:26:23,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 19:26:23,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 19:26:23,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 19:26:23,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 19:26:23,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 19:26:23,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:23,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765cd945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23, skipping insertion in model container [2020-12-02 19:26:23,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:23,717 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 19:26:23,734 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 19:26:23,904 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2020-12-02 19:26:23,909 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:26:23,927 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 19:26:23,942 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div_bad.i.p+cfa-reducer.c[674,687] [2020-12-02 19:26:23,943 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:26:23,962 INFO L217 MainTranslator]: Completed translation [2020-12-02 19:26:23,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23 WrapperNode [2020-12-02 19:26:23,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 19:26:23,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 19:26:23,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 19:26:23,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 19:26:23,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:23,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 19:26:24,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 19:26:24,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 19:26:24,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 19:26:24,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... [2020-12-02 19:26:24,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 19:26:24,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 19:26:24,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 19:26:24,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 19:26:24,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 19:26:24,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 19:26:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 19:26:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 19:26:24,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 19:26:24,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 19:26:28,634 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 19:26:28,634 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-02 19:26:28,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:28 BoogieIcfgContainer [2020-12-02 19:26:28,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 19:26:28,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 19:26:28,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 19:26:28,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 19:26:28,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:26:23" (1/3) ... [2020-12-02 19:26:28,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b32e7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:26:28, skipping insertion in model container [2020-12-02 19:26:28,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:26:23" (2/3) ... [2020-12-02 19:26:28,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b32e7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:26:28, skipping insertion in model container [2020-12-02 19:26:28,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:28" (3/3) ... [2020-12-02 19:26:28,645 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i.p+cfa-reducer.c [2020-12-02 19:26:28,657 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 19:26:28,661 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 19:26:28,672 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 19:26:28,697 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 19:26:28,697 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 19:26:28,698 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 19:26:28,698 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 19:26:28,698 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 19:26:28,698 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 19:26:28,698 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 19:26:28,698 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 19:26:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-02 19:26:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-02 19:26:28,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:26:28,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-02 19:26:28,715 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:26:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:26:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-02 19:26:28,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:26:28,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123825637] [2020-12-02 19:26:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 19:26:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 19:26:29,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 19:26:29,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:26:31,993 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (exists ((|v_ULTIMATE.start_main_#t~nondet8_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_6|)))) (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))))))) is different from false [2020-12-02 19:26:32,013 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-02 19:26:32,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:26:34,285 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_7 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_7 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_7))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_7))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_6|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (= .cse1 (fp.div c_~CRM .cse0 .cse2))) (not (fp.eq .cse1 .cse0)) (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse2))))) is different from true [2020-12-02 19:26:34,286 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-02 19:26:34,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123825637] [2020-12-02 19:26:34,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 19:26:34,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-12-02 19:26:34,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787538204] [2020-12-02 19:26:34,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 19:26:34,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:26:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 19:26:34,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2020-12-02 19:26:34,317 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 6 states. [2020-12-02 19:26:55,802 WARN L197 SmtUtils]: Spent 17.24 s on a formula simplification that was a NOOP. DAG size: 31 [2020-12-02 19:26:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 19:26:59,357 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-12-02 19:26:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 19:26:59,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-12-02 19:26:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 19:26:59,366 INFO L225 Difference]: With dead ends: 16 [2020-12-02 19:26:59,366 INFO L226 Difference]: Without dead ends: 7 [2020-12-02 19:26:59,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=13, Invalid=13, Unknown=2, NotChecked=14, Total=42 [2020-12-02 19:26:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-12-02 19:26:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-12-02 19:26:59,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-12-02 19:26:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-12-02 19:26:59,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-12-02 19:26:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 19:26:59,397 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-12-02 19:26:59,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 19:26:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-12-02 19:26:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-02 19:26:59,398 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:26:59,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-02 19:26:59,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 19:26:59,602 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:26:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:26:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-12-02 19:26:59,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:26:59,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012924553] [2020-12-02 19:26:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 19:27:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 19:27:01,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-02 19:27:01,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:27:03,373 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse1)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 19:27:05,784 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))))) (exists ((v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (= (fp.div roundNearestTiesToEven .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))))) is different from false [2020-12-02 19:27:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-12-02 19:27:05,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:27:08,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0)) (not (fp.eq .cse1 .cse2)) (not (= (fp.div c_~CRM .cse2 .cse0) .cse1))))) is different from false [2020-12-02 19:27:10,617 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0)) (not (fp.eq .cse1 .cse2)) (not (= (fp.div c_~CRM .cse2 .cse0) .cse1))))) is different from true [2020-12-02 19:27:13,135 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_10))) (.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (or (not (= .cse0 .cse1)) (not (= (fp.div c_~CRM .cse2 .cse1) .cse3)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4)) (not (fp.eq .cse3 .cse2)) (not (= .cse2 (fp.div c_~CRM .cse4 .cse5))) (not (= .cse0 .cse5))))) is different from true [2020-12-02 19:27:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-12-02 19:27:13,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012924553] [2020-12-02 19:27:13,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 19:27:13,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-12-02 19:27:13,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162966617] [2020-12-02 19:27:13,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 19:27:13,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:27:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 19:27:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2020-12-02 19:27:13,140 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-12-02 19:27:18,052 WARN L197 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 49 [2020-12-02 19:27:21,750 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse1)))) (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse2)) (not (fp.eq .cse3 .cse4)) (not (= (fp.div c_~CRM .cse4 .cse2) .cse3))))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from false [2020-12-02 19:27:24,212 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse1)))) (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse2)) (not (fp.eq .cse3 .cse4)) (not (= (fp.div c_~CRM .cse4 .cse2) .cse3))))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-12-02 19:27:26,594 WARN L838 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (exists ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|)))) (and (= .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))))) (exists ((v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0))) (= (fp.div roundNearestTiesToEven .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))))) is different from false [2020-12-02 19:27:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 19:27:31,304 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-12-02 19:27:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 19:27:31,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-12-02 19:27:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 19:27:31,306 INFO L225 Difference]: With dead ends: 11 [2020-12-02 19:27:31,306 INFO L226 Difference]: Without dead ends: 8 [2020-12-02 19:27:31,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=20, Invalid=15, Unknown=9, NotChecked=66, Total=110 [2020-12-02 19:27:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-02 19:27:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-02 19:27:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-02 19:27:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-12-02 19:27:31,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-12-02 19:27:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 19:27:31,311 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-12-02 19:27:31,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 19:27:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-12-02 19:27:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-02 19:27:31,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:27:31,312 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-12-02 19:27:31,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 19:27:31,514 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:27:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:27:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-12-02 19:27:31,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:27:31,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550345277] [2020-12-02 19:27:31,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 19:27:33,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-02 19:27:33,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 19:27:33,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-02 19:27:33,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:27:36,177 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1) (= (fp.div c_~CRM .cse1 .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))))))) is different from false [2020-12-02 19:27:38,593 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (= (fp.div c_~CRM .cse3 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse4 .cse2) .cse3))))) is different from false [2020-12-02 19:27:41,342 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_12 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_12))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|)))) (and (= .cse1 .cse2) (= .cse3 (fp.div c_~CRM .cse4 .cse5)) (= .cse1 .cse5) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse3 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))))) is different from false [2020-12-02 19:27:41,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 19:27:41,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-02 19:27:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-02 19:27:41,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:27:41,748 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 19:27:43,976 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0)) (not (fp.eq .cse1 .cse2)) (not (= .cse1 (fp.div c_~CRM .cse2 .cse0))))))) is different from true [2020-12-02 19:27:46,426 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_14))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= .cse0 .cse1)) (not (= .cse0 .cse2)) (not (fp.eq .cse3 .cse4)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2) .cse4)) (fp.eq .cse4 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (fp.div c_~CRM .cse4 .cse1)))))) is different from true [2020-12-02 19:27:49,236 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_15 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_15))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_14)))) (or (not (= .cse0 .cse1)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2)) (not (= .cse0 .cse3)) (not (= .cse0 .cse4)) (not (fp.eq .cse5 .cse6)) (not (= (fp.div c_~CRM .cse2 .cse4) .cse7)) (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse5 (fp.div c_~CRM .cse6 .cse1))) (not (= (fp.div c_~CRM .cse7 .cse3) .cse6))))) is different from true [2020-12-02 19:27:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-02 19:27:49,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550345277] [2020-12-02 19:27:49,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 19:27:49,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-12-02 19:27:49,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327788535] [2020-12-02 19:27:49,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 19:27:49,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:27:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 19:27:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=6, NotChecked=66, Total=110 [2020-12-02 19:27:49,241 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2020-12-02 19:27:54,972 WARN L197 SmtUtils]: Spent 2.87 s on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 19:27:58,982 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1) (= (fp.div c_~CRM .cse1 .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse2 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_14))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= .cse2 .cse3)) (not (= .cse2 .cse4)) (not (fp.eq .cse5 .cse6)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse4) .cse6)) (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse5 (fp.div c_~CRM .cse6 .cse3)))))) (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse7))))) is different from false [2020-12-02 19:28:03,016 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (= (fp.div c_~CRM .cse3 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse4 .cse2) .cse3)))) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse5)) (not (fp.eq .cse6 .cse7)) (not (= .cse6 (fp.div c_~CRM .cse7 .cse5)))))))) is different from false [2020-12-02 19:28:05,215 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= .cse0 .cse1) (= .cse0 .cse2) (= (fp.div c_~CRM .cse3 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse4 .cse2) .cse3)))) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse5)) (not (fp.eq .cse6 .cse7)) (not (= .cse6 (fp.div c_~CRM .cse7 .cse5)))))))) is different from true [2020-12-02 19:28:07,878 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_12 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_12))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|)))) (and (= .cse1 .cse2) (= .cse3 (fp.div c_~CRM .cse4 .cse5)) (= .cse1 .cse5) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse3 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))))) (let ((.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))))) is different from false [2020-12-02 19:28:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 19:28:12,616 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-12-02 19:28:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 19:28:12,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2020-12-02 19:28:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 19:28:12,618 INFO L225 Difference]: With dead ends: 12 [2020-12-02 19:28:12,618 INFO L226 Difference]: Without dead ends: 9 [2020-12-02 19:28:12,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=28, Invalid=27, Unknown=11, NotChecked=144, Total=210 [2020-12-02 19:28:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-12-02 19:28:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-12-02 19:28:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-12-02 19:28:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-12-02 19:28:12,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-12-02 19:28:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 19:28:12,623 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-12-02 19:28:12,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 19:28:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-12-02 19:28:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-02 19:28:12,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:28:12,624 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-12-02 19:28:12,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 19:28:12,838 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:28:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:28:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-12-02 19:28:12,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:28:12,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231601706] [2020-12-02 19:28:12,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-02 19:28:16,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-02 19:28:16,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 19:28:16,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-02 19:28:16,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:28:18,513 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse1)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 19:28:20,972 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_16 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_16))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse3 .cse4) (= .cse4 .cse1) (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))))))) is different from false [2020-12-02 19:28:23,603 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_17 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_16))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_17))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse3 .cse4) (= .cse5 .cse4) (= .cse4 .cse1) (= (fp.div c_~CRM .cse2 .cse3) .cse6) (= (fp.div c_~CRM .cse6 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))))))) is different from false [2020-12-02 19:28:27,151 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|)))) (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse0)))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_17 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_18 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_16))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_17))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse6 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_18))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|)))) (and (= (fp.div c_~CRM .cse1 .cse2) .cse3) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= (fp.div c_~CRM .cse4 .cse5) .cse1) (= .cse2 .cse6) (= .cse7 .cse6) (= .cse6 .cse5) (= (fp.div c_~CRM .cse3 .cse7) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))))) is different from false [2020-12-02 19:28:27,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 19:28:27,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-02 19:28:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-12-02 19:28:27,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:28:27,604 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 19:28:29,828 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 .cse2) .cse0)) (not (= ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)) .cse2))))) (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) is different from true [2020-12-02 19:28:32,330 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_20)))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse1 .cse2)) (not (fp.eq .cse3 .cse0)) (not (= (fp.div c_~CRM .cse0 .cse2) .cse3)) (not (= .cse4 .cse1)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse4) .cse0))))) is different from true [2020-12-02 19:28:34,978 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_20))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_21))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 8.0 5.0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 .cse4)) (not (fp.eq .cse5 .cse0)) (not (= (fp.div c_~CRM .cse0 .cse4) .cse5)) (not (= .cse2 .cse3)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))) (not (= .cse6 .cse3))))) is different from true [2020-12-02 19:28:37,715 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-02 19:28:37,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231601706] [2020-12-02 19:28:37,718 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-02 19:28:37,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [221604289] [2020-12-02 19:28:37,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-12-02 19:28:37,743 WARN L195 Executor]: External (cvc4 --incremental --print-success --lang smt --rewrite-divk) stderr output: (error "Error in option parsing: can't understand option `--rewrite-divk'") Please use --help to get help on command-line options. [2020-12-02 19:28:37,745 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (cvc4 --incremental --print-success --lang smt --rewrite-divk)Received EOF on stdin. stderr output: (error "Error in option parsing: can't understand option `--rewrite-divk'") Please use --help to get help on command-line options. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.createProcess(Executor.java:108) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.(Executor.java:83) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.(Scriptor.java:72) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.solverbuilder.SolverBuilder.buildScript(SolverBuilder.java:149) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.solverbuilder.SolverBuilder.buildAndInitializeSolver(SolverBuilder.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 34 more [2020-12-02 19:28:37,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094042744] [2020-12-02 19:28:37,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-02 19:31:55,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-02 19:31:55,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 19:31:56,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-02 19:31:56,306 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@1ecaf295 [2020-12-02 19:31:56,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-02 19:31:56,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-02 19:31:56,306 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-12-02 19:31:56,306 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2020-12-02 19:31:56,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-02 19:31:56,746 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-02 19:31:56,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:31:56 BoogieIcfgContainer [2020-12-02 19:31:56,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 19:31:56,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 19:31:56,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 19:31:56,752 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 19:31:56,752 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:28" (3/4) ... [2020-12-02 19:31:56,757 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 19:31:56,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 19:31:56,759 INFO L168 Benchmark]: Toolchain (without parser) took 333067.43 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.1 MB in the beginning and 50.1 MB in the end (delta: -19.1 MB). Peak memory consumption was 107.3 kB. Max. memory is 16.1 GB. [2020-12-02 19:31:56,760 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 54.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:31:56,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.18 ms. Allocated memory is still 54.5 MB. Free memory was 30.8 MB in the beginning and 34.0 MB in the end (delta: -3.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-12-02 19:31:56,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 54.5 MB. Free memory was 34.0 MB in the beginning and 32.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 19:31:56,770 INFO L168 Benchmark]: Boogie Preprocessor took 28.29 ms. Allocated memory is still 54.5 MB. Free memory was 32.7 MB in the beginning and 31.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:31:56,772 INFO L168 Benchmark]: RCFGBuilder took 4603.79 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.4 MB in the beginning and 49.2 MB in the end (delta: -17.8 MB). Peak memory consumption was 10.1 MB. Max. memory is 16.1 GB. [2020-12-02 19:31:56,773 INFO L168 Benchmark]: TraceAbstraction took 328109.64 ms. Allocated memory is still 71.3 MB. Free memory was 48.9 MB in the beginning and 50.7 MB in the end (delta: -1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:31:56,773 INFO L168 Benchmark]: Witness Printer took 9.10 ms. Allocated memory is still 71.3 MB. Free memory was 50.7 MB in the beginning and 50.1 MB in the end (delta: 566.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:31:56,781 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.27 ms. Allocated memory is still 54.5 MB. Free memory was 36.1 MB in the beginning and 36.1 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 266.18 ms. Allocated memory is still 54.5 MB. Free memory was 30.8 MB in the beginning and 34.0 MB in the end (delta: -3.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 54.5 MB. Free memory was 34.0 MB in the beginning and 32.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.29 ms. Allocated memory is still 54.5 MB. Free memory was 32.7 MB in the beginning and 31.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4603.79 ms. Allocated memory was 54.5 MB in the beginning and 71.3 MB in the end (delta: 16.8 MB). Free memory was 31.4 MB in the beginning and 49.2 MB in the end (delta: -17.8 MB). Peak memory consumption was 10.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 328109.64 ms. Allocated memory is still 71.3 MB. Free memory was 48.9 MB in the beginning and 50.7 MB in the end (delta: -1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 9.10 ms. Allocated memory is still 71.3 MB. Free memory was 50.7 MB in the beginning and 50.1 MB in the end (delta: 566.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 27]: 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: [L1] int __return_main; [L9] EXPR 1.0 [L9] double main__x = 1.0; [L10] EXPR 1.6 [L10] EXPR main__x / 1.6 [L10] double main__x1 = main__x / 1.6; [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] EXPR 1.6 [L15] EXPR main__x / 1.6 [L15] main__x1 = main__x / 1.6 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] EXPR 1.6 [L15] EXPR main__x / 1.6 [L15] main__x1 = main__x / 1.6 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] EXPR 1.6 [L15] EXPR main__x / 1.6 [L15] main__x1 = main__x / 1.6 [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 [L25] COND TRUE __VERIFIER_assert__cond == 0 [L27] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 328.0s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 66.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 3 SDslu, 40 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 30 ConstructedInterpolants, 12 QuantifiedInterpolants, 5894 SizeOfPredicates, 13 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/8 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...