./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54a68f41 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/Float_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 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 .............................................................................................................................................................................................................................................. 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/Float_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 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.1-54a68f4 [2020-12-03 18:55:39,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 18:55:39,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 18:55:39,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 18:55:39,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 18:55:39,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 18:55:39,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 18:55:39,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 18:55:39,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 18:55:39,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 18:55:39,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 18:55:39,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 18:55:39,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 18:55:39,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 18:55:39,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 18:55:39,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 18:55:39,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 18:55:39,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 18:55:39,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 18:55:39,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 18:55:39,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 18:55:39,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 18:55:39,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 18:55:39,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 18:55:39,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 18:55:39,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 18:55:39,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 18:55:39,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 18:55:39,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 18:55:39,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 18:55:39,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 18:55:39,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 18:55:39,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 18:55:39,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 18:55:39,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 18:55:39,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 18:55:39,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 18:55:39,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 18:55:39,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 18:55:39,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 18:55:39,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 18:55:39,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 18:55:39,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 18:55:39,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 18:55:39,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 18:55:39,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 18:55:39,855 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 18:55:39,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 18:55:39,855 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 18:55:39,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 18:55:39,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 18:55:39,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 18:55:39,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 18:55:39,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 18:55:39,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 18:55:39,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 18:55:39,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 18:55:39,857 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 18:55:39,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 18:55:39,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 18:55:39,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 18:55:39,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 18:55:39,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 18:55:39,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 18:55:39,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 18:55:39,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 18:55:39,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 18:55:39,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 18:55:39,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 18:55:39,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 18:55:39,861 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 -> 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 [2020-12-03 18:55:40,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 18:55:40,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 18:55:40,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 18:55:40,281 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 18:55:40,282 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 18:55:40,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-12-03 18:55:40,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabebc6de/8fd463e94f674552b40a6055034594bf/FLAGd72585243 [2020-12-03 18:55:41,084 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 18:55:41,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-12-03 18:55:41,092 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabebc6de/8fd463e94f674552b40a6055034594bf/FLAGd72585243 [2020-12-03 18:55:41,466 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fabebc6de/8fd463e94f674552b40a6055034594bf [2020-12-03 18:55:41,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 18:55:41,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 18:55:41,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 18:55:41,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 18:55:41,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 18:55:41,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c41c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41, skipping insertion in model container [2020-12-03 18:55:41,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 18:55:41,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 18:55:41,704 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/Float_div_bad.i.p+cfa-reducer.c[699,712] [2020-12-03 18:55:41,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:55:41,720 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 18:55:41,736 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/Float_div_bad.i.p+cfa-reducer.c[699,712] [2020-12-03 18:55:41,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:55:41,753 INFO L208 MainTranslator]: Completed translation [2020-12-03 18:55:41,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41 WrapperNode [2020-12-03 18:55:41,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 18:55:41,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 18:55:41,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 18:55:41,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 18:55:41,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 18:55:41,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 18:55:41,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 18:55:41,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 18:55:41,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (1/1) ... [2020-12-03 18:55:41,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 18:55:41,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 18:55:41,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 18:55:41,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 18:55:41,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (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-03 18:55:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 18:55:41,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 18:55:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 18:55:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 18:55:42,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 18:55:42,124 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-03 18:55:42,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:55:42 BoogieIcfgContainer [2020-12-03 18:55:42,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 18:55:42,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 18:55:42,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 18:55:42,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 18:55:42,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:55:41" (1/3) ... [2020-12-03 18:55:42,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795fd0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:55:42, skipping insertion in model container [2020-12-03 18:55:42,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:41" (2/3) ... [2020-12-03 18:55:42,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795fd0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:55:42, skipping insertion in model container [2020-12-03 18:55:42,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:55:42" (3/3) ... [2020-12-03 18:55:42,136 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2020-12-03 18:55:42,161 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 18:55:42,164 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 18:55:42,178 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 18:55:42,236 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 18:55:42,239 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 18:55:42,239 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 18:55:42,239 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 18:55:42,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 18:55:42,240 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 18:55:42,240 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 18:55:42,240 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 18:55:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-03 18:55:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-03 18:55:42,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:55:42,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-03 18:55:42,279 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:55:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:55:42,286 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-03 18:55:42,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 18:55:42,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958238566] [2020-12-03 18:55:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 18:55:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 18:55:42,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 18:55:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 18:55:42,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 18:55:42,538 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 18:55:42,539 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 18:55:42,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 18:55:42,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:55:42 BoogieIcfgContainer [2020-12-03 18:55:42,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 18:55:42,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 18:55:42,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 18:55:42,569 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 18:55:42,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:55:42" (3/4) ... [2020-12-03 18:55:42,574 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-03 18:55:42,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 18:55:42,577 INFO L168 Benchmark]: Toolchain (without parser) took 1104.08 ms. Allocated memory is still 60.8 MB. Free memory was 37.7 MB in the beginning and 33.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2020-12-03 18:55:42,578 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 41.9 MB. Free memory was 19.8 MB in the beginning and 19.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:55:42,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.35 ms. Allocated memory is still 60.8 MB. Free memory was 37.5 MB in the beginning and 43.4 MB in the end (delta: -5.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-03 18:55:42,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.49 ms. Allocated memory is still 60.8 MB. Free memory was 43.2 MB in the beginning and 41.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:55:42,582 INFO L168 Benchmark]: Boogie Preprocessor took 21.18 ms. Allocated memory is still 60.8 MB. Free memory was 41.9 MB in the beginning and 41.0 MB in the end (delta: 903.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:55:42,583 INFO L168 Benchmark]: RCFGBuilder took 312.49 ms. Allocated memory is still 60.8 MB. Free memory was 41.0 MB in the beginning and 30.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-03 18:55:42,585 INFO L168 Benchmark]: TraceAbstraction took 440.11 ms. Allocated memory is still 60.8 MB. Free memory was 30.3 MB in the beginning and 33.8 MB in the end (delta: -3.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:55:42,586 INFO L168 Benchmark]: Witness Printer took 5.82 ms. Allocated memory is still 60.8 MB. Free memory was 33.8 MB in the beginning and 33.5 MB in the end (delta: 271.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:55:42,592 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.59 ms. Allocated memory is still 41.9 MB. Free memory was 19.8 MB in the beginning and 19.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 280.35 ms. Allocated memory is still 60.8 MB. Free memory was 37.5 MB in the beginning and 43.4 MB in the end (delta: -5.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.49 ms. Allocated memory is still 60.8 MB. Free memory was 43.2 MB in the beginning and 41.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.18 ms. Allocated memory is still 60.8 MB. Free memory was 41.9 MB in the beginning and 41.0 MB in the end (delta: 903.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 312.49 ms. Allocated memory is still 60.8 MB. Free memory was 41.0 MB in the beginning and 30.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 440.11 ms. Allocated memory is still 60.8 MB. Free memory was 30.3 MB in the beginning and 33.8 MB in the end (delta: -3.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.82 ms. Allocated memory is still 60.8 MB. Free memory was 33.8 MB in the beginning and 33.5 MB in the end (delta: 271.8 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 someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 1.600000023841858; 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.1-54a68f4 [2020-12-03 18:55:45,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 18:55:45,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 18:55:45,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 18:55:45,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 18:55:45,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 18:55:45,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 18:55:45,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 18:55:45,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 18:55:45,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 18:55:45,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 18:55:45,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 18:55:45,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 18:55:45,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 18:55:45,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 18:55:45,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 18:55:45,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 18:55:45,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 18:55:45,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 18:55:45,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 18:55:45,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 18:55:45,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 18:55:45,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 18:55:45,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 18:55:45,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 18:55:45,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 18:55:45,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 18:55:45,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 18:55:45,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 18:55:45,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 18:55:45,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 18:55:45,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 18:55:45,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 18:55:45,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 18:55:45,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 18:55:45,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 18:55:45,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 18:55:45,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 18:55:45,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 18:55:45,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 18:55:45,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 18:55:45,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-03 18:55:45,372 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 18:55:45,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 18:55:45,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 18:55:45,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 18:55:45,376 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 18:55:45,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 18:55:45,377 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 18:55:45,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 18:55:45,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 18:55:45,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 18:55:45,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 18:55:45,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 18:55:45,379 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-03 18:55:45,380 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-03 18:55:45,380 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 18:55:45,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 18:55:45,380 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 18:55:45,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 18:55:45,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 18:55:45,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 18:55:45,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 18:55:45,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 18:55:45,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 18:55:45,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 18:55:45,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 18:55:45,383 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-03 18:55:45,383 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-03 18:55:45,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 18:55:45,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 18:55:45,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 18:55:45,384 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 -> 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 [2020-12-03 18:55:45,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 18:55:45,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 18:55:45,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 18:55:45,894 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 18:55:45,895 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 18:55:45,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-12-03 18:55:45,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7075eb6d2/869a3e9ec342482b84f146d7260c9291/FLAGc6bbc8acc [2020-12-03 18:55:46,547 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 18:55:46,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2020-12-03 18:55:46,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7075eb6d2/869a3e9ec342482b84f146d7260c9291/FLAGc6bbc8acc [2020-12-03 18:55:46,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7075eb6d2/869a3e9ec342482b84f146d7260c9291 [2020-12-03 18:55:46,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 18:55:46,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 18:55:46,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 18:55:46,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 18:55:46,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 18:55:46,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:55:46" (1/1) ... [2020-12-03 18:55:46,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138a03ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:46, skipping insertion in model container [2020-12-03 18:55:46,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:55:46" (1/1) ... [2020-12-03 18:55:46,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 18:55:46,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 18:55:47,165 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/Float_div_bad.i.p+cfa-reducer.c[699,712] [2020-12-03 18:55:47,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:55:47,208 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 18:55:47,231 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/Float_div_bad.i.p+cfa-reducer.c[699,712] [2020-12-03 18:55:47,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:55:47,260 INFO L208 MainTranslator]: Completed translation [2020-12-03 18:55:47,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47 WrapperNode [2020-12-03 18:55:47,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 18:55:47,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 18:55:47,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 18:55:47,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 18:55:47,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 18:55:47,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 18:55:47,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 18:55:47,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 18:55:47,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (1/1) ... [2020-12-03 18:55:47,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 18:55:47,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 18:55:47,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 18:55:47,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 18:55:47,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (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-03 18:55:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 18:55:47,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 18:55:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-03 18:55:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 18:55:52,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 18:55:52,050 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-03 18:55:52,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:55:52 BoogieIcfgContainer [2020-12-03 18:55:52,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 18:55:52,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 18:55:52,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 18:55:52,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 18:55:52,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:55:46" (1/3) ... [2020-12-03 18:55:52,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7b8cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:55:52, skipping insertion in model container [2020-12-03 18:55:52,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:55:47" (2/3) ... [2020-12-03 18:55:52,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7b8cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:55:52, skipping insertion in model container [2020-12-03 18:55:52,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:55:52" (3/3) ... [2020-12-03 18:55:52,061 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2020-12-03 18:55:52,077 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 18:55:52,080 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 18:55:52,093 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 18:55:52,118 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 18:55:52,119 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 18:55:52,119 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 18:55:52,119 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 18:55:52,119 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 18:55:52,120 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 18:55:52,120 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 18:55:52,120 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 18:55:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-03 18:55:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-03 18:55:52,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:55:52,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-03 18:55:52,140 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:55:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:55:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-03 18:55:52,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:55:52,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377641075] [2020-12-03 18:55:52,160 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-03 18:55:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:55:53,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-03 18:55:53,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:55:55,493 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))))) is different from true [2020-12-03 18:55:55,508 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-03 18:55:55,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 18:55:55,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377641075] [2020-12-03 18:55:55,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 18:55:55,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 18:55:55,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164985069] [2020-12-03 18:55:55,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 18:55:55,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:55:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 18:55:55,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2020-12-03 18:55:55,533 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2020-12-03 18:56:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:56:00,881 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-12-03 18:56:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 18:56:00,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-12-03 18:56:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:56:00,891 INFO L225 Difference]: With dead ends: 16 [2020-12-03 18:56:00,891 INFO L226 Difference]: Without dead ends: 7 [2020-12-03 18:56:00,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2020-12-03 18:56:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-12-03 18:56:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-12-03 18:56:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-12-03 18:56:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-12-03 18:56:00,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-12-03 18:56:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:56:00,925 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-12-03 18:56:00,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 18:56:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-12-03 18:56:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-03 18:56:00,926 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:56:00,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-03 18:56:01,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-03 18:56:01,140 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:56:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:56:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-12-03 18:56:01,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:56:01,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456164681] [2020-12-03 18:56:01,144 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-03 18:56:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:56:02,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-03 18:56:02,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:56:04,843 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:56:06,996 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:56:07,010 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-03 18:56:07,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 18:56:09,233 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-12-03 18:56:11,390 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-12-03 18:56:13,688 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:56:15,985 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:56:15,986 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-03 18:56:15,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456164681] [2020-12-03 18:56:15,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 18:56:15,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-12-03 18:56:15,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524050667] [2020-12-03 18:56:15,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 18:56:15,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:56:15,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 18:56:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2020-12-03 18:56:15,990 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-12-03 18:56:18,322 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-12-03 18:56:20,644 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 18:56:22,789 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:56:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:56:27,469 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-12-03 18:56:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 18:56:27,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-12-03 18:56:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:56:27,470 INFO L225 Difference]: With dead ends: 11 [2020-12-03 18:56:27,470 INFO L226 Difference]: Without dead ends: 8 [2020-12-03 18:56:27,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=19, Invalid=12, Unknown=9, NotChecked=70, Total=110 [2020-12-03 18:56:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-03 18:56:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-03 18:56:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-03 18:56:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-12-03 18:56:27,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-12-03 18:56:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:56:27,475 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-12-03 18:56:27,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 18:56:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-12-03 18:56:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-03 18:56:27,475 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:56:27,475 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-12-03 18:56:27,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-03 18:56:27,677 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:56:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:56:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-12-03 18:56:27,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:56:27,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678362529] [2020-12-03 18:56:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03 18:56:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:56:30,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-03 18:56:30,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:56:32,284 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:56:34,610 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:56:36,771 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:56:36,778 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-03 18:56:36,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 18:56:39,018 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-12-03 18:56:41,173 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-12-03 18:56:43,503 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:56:45,816 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:56:48,252 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:56:50,699 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:56:50,700 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-03 18:56:50,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678362529] [2020-12-03 18:56:50,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 18:56:50,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-12-03 18:56:50,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716391846] [2020-12-03 18:56:50,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 18:56:50,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:56:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 18:56:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=10, Unknown=9, NotChecked=54, Total=90 [2020-12-03 18:56:50,703 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2020-12-03 18:56:53,166 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-12-03 18:56:55,643 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 18:56:58,136 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 18:57:00,303 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:57:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:57:04,985 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-12-03 18:57:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 18:57:04,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2020-12-03 18:57:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:57:04,987 INFO L225 Difference]: With dead ends: 12 [2020-12-03 18:57:04,987 INFO L226 Difference]: Without dead ends: 9 [2020-12-03 18:57:04,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=25, Invalid=14, Unknown=13, NotChecked=130, Total=182 [2020-12-03 18:57:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-12-03 18:57:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-12-03 18:57:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-12-03 18:57:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-12-03 18:57:04,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-12-03 18:57:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:57:04,991 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-12-03 18:57:04,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 18:57:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-12-03 18:57:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-03 18:57:04,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:57:04,993 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-12-03 18:57:05,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-03 18:57:05,207 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:57:05,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:57:05,209 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-12-03 18:57:05,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:57:05,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953685433] [2020-12-03 18:57:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-03 18:57:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:57:08,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 18:57:08,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:57:10,589 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:57:12,934 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:57:15,508 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 18:57:17,687 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:57:17,695 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-03 18:57:17,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 18:57:19,933 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-12-03 18:57:22,082 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-12-03 18:57:24,370 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:57:26,662 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:57:29,109 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:57:31,574 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:57:34,233 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:57:36,828 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:57:36,829 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-03 18:57:36,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953685433] [2020-12-03 18:57:36,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 18:57:36,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-12-03 18:57:36,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156208080] [2020-12-03 18:57:36,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 18:57:36,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:57:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 18:57:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=11, Unknown=12, NotChecked=88, Total=132 [2020-12-03 18:57:36,833 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 12 states. [2020-12-03 18:57:39,480 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-12-03 18:57:42,323 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-12-03 18:57:45,055 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-12-03 18:57:47,777 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 18:57:50,611 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from false [2020-12-03 18:57:53,318 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 18:57:55,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:58:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:58:00,219 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-12-03 18:58:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 18:58:00,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2020-12-03 18:58:00,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:58:00,221 INFO L225 Difference]: With dead ends: 13 [2020-12-03 18:58:00,221 INFO L226 Difference]: Without dead ends: 10 [2020-12-03 18:58:00,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=31, Invalid=14, Unknown=19, NotChecked=208, Total=272 [2020-12-03 18:58:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-12-03 18:58:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-12-03 18:58:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-03 18:58:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-03 18:58:00,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-12-03 18:58:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:58:00,226 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-03 18:58:00,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 18:58:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-03 18:58:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 18:58:00,227 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:58:00,227 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-12-03 18:58:00,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-03 18:58:00,431 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:58:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:58:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2020-12-03 18:58:00,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:58:00,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097580539] [2020-12-03 18:58:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-03 18:58:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:58:04,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-03 18:58:04,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:58:06,439 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:58:08,752 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:58:11,341 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 18:58:14,040 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:58:16,208 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:58:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-12-03 18:58:16,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 18:58:18,492 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-12-03 18:58:20,641 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-12-03 18:58:22,943 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:58:25,250 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:58:27,716 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:58:30,195 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:58:33,010 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:58:35,849 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:58:38,587 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:58:41,304 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:58:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-12-03 18:58:41,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097580539] [2020-12-03 18:58:41,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 18:58:41,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-12-03 18:58:41,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590002171] [2020-12-03 18:58:41,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-03 18:58:41,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:58:41,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-03 18:58:41,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=12, Unknown=15, NotChecked=130, Total=182 [2020-12-03 18:58:41,308 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 14 states. [2020-12-03 18:58:44,084 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-12-03 18:58:47,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-12-03 18:58:49,854 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-12-03 18:58:52,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-12-03 18:58:55,567 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-12-03 18:58:58,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from false [2020-12-03 18:59:01,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2020-12-03 18:59:04,151 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 18:59:06,314 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 18:59:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:59:11,072 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-12-03 18:59:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 18:59:11,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2020-12-03 18:59:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:59:11,074 INFO L225 Difference]: With dead ends: 14 [2020-12-03 18:59:11,074 INFO L226 Difference]: Without dead ends: 11 [2020-12-03 18:59:11,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.0s TimeCoverageRelationStatistics Valid=37, Invalid=15, Unknown=24, NotChecked=304, Total=380 [2020-12-03 18:59:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-03 18:59:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-12-03 18:59:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-12-03 18:59:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-12-03 18:59:11,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-12-03 18:59:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:59:11,078 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-12-03 18:59:11,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-03 18:59:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-12-03 18:59:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-03 18:59:11,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:59:11,078 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-12-03 18:59:11,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-03 18:59:11,280 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:59:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:59:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 5 times [2020-12-03 18:59:11,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:59:11,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011918647] [2020-12-03 18:59:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-03 18:59:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:59:16,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-03 18:59:16,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:59:18,295 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:59:20,620 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:59:23,117 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 18:59:25,932 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:59:28,779 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:59:30,958 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 18:59:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2020-12-03 18:59:30,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 18:59:33,270 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-12-03 18:59:35,429 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-12-03 18:59:37,751 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:59:40,065 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:59:42,553 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:59:45,050 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:59:47,947 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:59:50,890 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:59:53,845 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 18:59:56,811 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 18:59:59,646 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:00:02,474 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:00:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2020-12-03 19:00:02,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011918647] [2020-12-03 19:00:02,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 19:00:02,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-12-03 19:00:02,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134884246] [2020-12-03 19:00:02,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-03 19:00:02,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 19:00:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-03 19:00:02,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=13, Unknown=18, NotChecked=180, Total=240 [2020-12-03 19:00:02,478 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 16 states. [2020-12-03 19:00:05,327 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-12-03 19:00:08,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-12-03 19:00:11,287 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-12-03 19:00:14,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-12-03 19:00:17,223 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-12-03 19:00:20,121 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2020-12-03 19:00:23,054 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 19:00:25,954 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-12-03 19:00:28,129 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 19:00:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 19:00:32,901 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-12-03 19:00:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 19:00:32,904 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2020-12-03 19:00:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 19:00:32,905 INFO L225 Difference]: With dead ends: 15 [2020-12-03 19:00:32,905 INFO L226 Difference]: Without dead ends: 12 [2020-12-03 19:00:32,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.0s TimeCoverageRelationStatistics Valid=43, Invalid=18, Unknown=27, NotChecked=418, Total=506 [2020-12-03 19:00:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-12-03 19:00:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-12-03 19:00:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-12-03 19:00:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-12-03 19:00:32,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-12-03 19:00:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 19:00:32,910 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-12-03 19:00:32,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-03 19:00:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-12-03 19:00:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 19:00:32,911 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 19:00:32,911 INFO L422 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2020-12-03 19:00:33,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-03 19:00:33,113 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 19:00:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 19:00:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash 555748550, now seen corresponding path program 6 times [2020-12-03 19:00:33,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 19:00:33,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747097663] [2020-12-03 19:00:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-03 19:00:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 19:00:38,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-03 19:00:38,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 19:00:40,894 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 19:00:43,237 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 19:00:45,749 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-12-03 19:00:48,599 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 19:00:51,462 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 19:00:54,330 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 19:00:56,516 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-12-03 19:00:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2020-12-03 19:00:56,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 19:00:58,805 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-12-03 19:01:00,962 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-12-03 19:01:03,280 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:01:05,613 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:01:08,110 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:01:10,597 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:01:13,580 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:01:16,563 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:01:19,564 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:01:22,560 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:01:25,576 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:01:28,582 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:01:31,479 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-12-03 19:01:34,363 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-12-03 19:01:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2020-12-03 19:01:34,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747097663] [2020-12-03 19:01:34,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 19:01:34,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-12-03 19:01:34,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266513670] [2020-12-03 19:01:34,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-03 19:01:34,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 19:01:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-03 19:01:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=14, Unknown=21, NotChecked=238, Total=306 [2020-12-03 19:01:34,366 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 18 states. [2020-12-03 19:01:37,261 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-12-03 19:01:39,212 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-03 19:01:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 19:01:39,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-03 19:01:39,415 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) 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) ... 45 more [2020-12-03 19:01:39,426 INFO L168 Benchmark]: Toolchain (without parser) took 352551.93 ms. Allocated memory is still 54.5 MB. Free memory was 37.7 MB in the beginning and 19.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2020-12-03 19:01:39,428 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 41.9 MB. Free memory was 20.1 MB in the beginning and 20.1 MB in the end (delta: 32.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 19:01:39,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.48 ms. Allocated memory is still 54.5 MB. Free memory was 37.5 MB in the beginning and 39.5 MB in the end (delta: -2.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 16.1 GB. [2020-12-03 19:01:39,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.02 ms. Allocated memory is still 54.5 MB. Free memory was 39.5 MB in the beginning and 38.1 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 19:01:39,430 INFO L168 Benchmark]: Boogie Preprocessor took 60.82 ms. Allocated memory is still 54.5 MB. Free memory was 38.1 MB in the beginning and 36.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 19:01:39,431 INFO L168 Benchmark]: RCFGBuilder took 4673.68 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 37.2 MB in the end (delta: -321.4 kB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-12-03 19:01:39,432 INFO L168 Benchmark]: TraceAbstraction took 347368.47 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 19.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. [2020-12-03 19:01:39,436 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.30 ms. Allocated memory is still 41.9 MB. Free memory was 20.1 MB in the beginning and 20.1 MB in the end (delta: 32.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 388.48 ms. Allocated memory is still 54.5 MB. Free memory was 37.5 MB in the beginning and 39.5 MB in the end (delta: -2.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.02 ms. Allocated memory is still 54.5 MB. Free memory was 39.5 MB in the beginning and 38.1 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.82 ms. Allocated memory is still 54.5 MB. Free memory was 38.1 MB in the beginning and 36.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4673.68 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 37.2 MB in the end (delta: -321.4 kB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 347368.47 ms. Allocated memory is still 54.5 MB. Free memory was 36.8 MB in the beginning and 19.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...