./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.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 fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 ............................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.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 fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-2880296 [2020-12-02 19:25:50,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 19:25:50,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 19:25:50,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 19:25:50,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 19:25:50,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 19:25:50,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 19:25:50,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 19:25:50,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 19:25:50,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 19:25:50,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 19:25:50,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 19:25:50,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 19:25:50,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 19:25:50,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 19:25:50,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 19:25:50,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 19:25:50,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 19:25:50,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 19:25:50,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 19:25:50,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 19:25:50,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 19:25:50,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 19:25:50,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 19:25:50,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 19:25:50,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 19:25:50,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 19:25:50,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 19:25:50,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 19:25:50,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 19:25:50,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 19:25:50,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 19:25:50,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 19:25:50,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 19:25:50,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 19:25:50,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 19:25:50,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 19:25:50,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 19:25:50,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 19:25:50,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 19:25:50,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 19:25:50,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 19:25:50,300 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 19:25:50,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 19:25:50,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 19:25:50,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 19:25:50,305 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 19:25:50,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 19:25:50,305 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 19:25:50,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 19:25:50,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 19:25:50,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 19:25:50,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 19:25:50,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 19:25:50,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 19:25:50,308 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 19:25:50,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 19:25:50,308 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 19:25:50,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 19:25:50,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 19:25:50,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 19:25:50,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 19:25:50,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 19:25:50,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 19:25:50,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 19:25:50,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 19:25:50,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 19:25:50,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 19:25:50,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 19:25:50,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 19:25:50,314 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 19:25:50,314 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 -> fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 [2020-12-02 19:25:50,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 19:25:50,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 19:25:50,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 19:25:50,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 19:25:50,774 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 19:25:50,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-12-02 19:25:50,869 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561a3dfee/3f4fdd05a7704ac4a9f208f2e0e4345c/FLAG4be774b5b [2020-12-02 19:25:51,484 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 19:25:51,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-12-02 19:25:51,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561a3dfee/3f4fdd05a7704ac4a9f208f2e0e4345c/FLAG4be774b5b [2020-12-02 19:25:51,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561a3dfee/3f4fdd05a7704ac4a9f208f2e0e4345c [2020-12-02 19:25:51,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 19:25:51,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 19:25:51,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 19:25:51,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 19:25:51,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 19:25:51,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:25:51" (1/1) ... [2020-12-02 19:25:51,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2029e426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:51, skipping insertion in model container [2020-12-02 19:25:51,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:25:51" (1/1) ... [2020-12-02 19:25:51,892 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 19:25:51,915 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 19:25:52,098 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2020-12-02 19:25:52,103 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:25:52,115 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 19:25:52,132 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2020-12-02 19:25:52,133 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:25:52,150 INFO L217 MainTranslator]: Completed translation [2020-12-02 19:25:52,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52 WrapperNode [2020-12-02 19:25:52,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 19:25:52,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 19:25:52,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 19:25:52,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 19:25:52,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 19:25:52,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 19:25:52,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 19:25:52,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 19:25:52,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... [2020-12-02 19:25:52,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 19:25:52,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 19:25:52,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 19:25:52,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 19:25:52,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 19:25:52,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 19:25:52,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 19:25:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 19:25:52,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 19:25:52,515 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 19:25:52,515 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-02 19:25:52,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:25:52 BoogieIcfgContainer [2020-12-02 19:25:52,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 19:25:52,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 19:25:52,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 19:25:52,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 19:25:52,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:25:51" (1/3) ... [2020-12-02 19:25:52,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@984bf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:25:52, skipping insertion in model container [2020-12-02 19:25:52,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:52" (2/3) ... [2020-12-02 19:25:52,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@984bf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:25:52, skipping insertion in model container [2020-12-02 19:25:52,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:25:52" (3/3) ... [2020-12-02 19:25:52,528 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2020-12-02 19:25:52,545 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 19:25:52,549 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 19:25:52,564 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 19:25:52,593 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 19:25:52,594 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 19:25:52,594 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 19:25:52,594 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 19:25:52,594 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 19:25:52,594 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 19:25:52,594 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 19:25:52,595 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 19:25:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-02 19:25:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-02 19:25:52,616 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:25:52,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-02 19:25:52,617 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:25:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:25:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-02 19:25:52,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 19:25:52,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793171569] [2020-12-02 19:25:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 19:25:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 19:25:52,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 19:25:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 19:25:52,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 19:25:52,902 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 19:25:52,903 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 19:25:52,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 19:25:52,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:25:52 BoogieIcfgContainer [2020-12-02 19:25:52,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 19:25:52,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 19:25:52,957 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 19:25:52,957 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 19:25:52,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:25:52" (3/4) ... [2020-12-02 19:25:52,967 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 19:25:52,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 19:25:52,975 INFO L168 Benchmark]: Toolchain (without parser) took 1109.22 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.2 MB in the beginning and 33.3 MB in the end (delta: -10.0 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. [2020-12-02 19:25:52,978 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 46.1 MB. Free memory was 32.8 MB in the beginning and 32.8 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:25:52,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.52 ms. Allocated memory is still 46.1 MB. Free memory was 23.0 MB in the beginning and 24.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-02 19:25:52,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.91 ms. Allocated memory is still 46.1 MB. Free memory was 24.7 MB in the beginning and 23.4 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:25:52,984 INFO L168 Benchmark]: Boogie Preprocessor took 18.36 ms. Allocated memory is still 46.1 MB. Free memory was 23.4 MB in the beginning and 22.4 MB in the end (delta: 988.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 19:25:52,985 INFO L168 Benchmark]: RCFGBuilder took 309.72 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.4 MB in the beginning and 32.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-12-02 19:25:52,987 INFO L168 Benchmark]: TraceAbstraction took 434.21 ms. Allocated memory is still 56.6 MB. Free memory was 31.7 MB in the beginning and 33.8 MB in the end (delta: -2.1 MB). Peak memory consumption was 929.5 kB. Max. memory is 16.1 GB. [2020-12-02 19:25:52,989 INFO L168 Benchmark]: Witness Printer took 12.24 ms. Allocated memory is still 56.6 MB. Free memory was 33.5 MB in the beginning and 33.3 MB in the end (delta: 262.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:25:53,007 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.61 ms. Allocated memory is still 46.1 MB. Free memory was 32.8 MB in the beginning and 32.8 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.52 ms. Allocated memory is still 46.1 MB. Free memory was 23.0 MB in the beginning and 24.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.91 ms. Allocated memory is still 46.1 MB. Free memory was 24.7 MB in the beginning and 23.4 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.36 ms. Allocated memory is still 46.1 MB. Free memory was 23.4 MB in the beginning and 22.4 MB in the end (delta: 988.6 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 309.72 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.4 MB in the beginning and 32.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 434.21 ms. Allocated memory is still 56.6 MB. Free memory was 31.7 MB in the beginning and 33.8 MB in the end (delta: -2.1 MB). Peak memory consumption was 929.5 kB. Max. memory is 16.1 GB. * Witness Printer took 12.24 ms. Allocated memory is still 56.6 MB. Free memory was 33.5 MB in the beginning and 33.3 MB in the end (delta: 262.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 10, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double main__x1 = main__x / 2.5; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L27] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-2880296 [2020-12-02 19:25:55,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 19:25:55,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 19:25:55,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 19:25:55,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 19:25:55,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 19:25:55,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 19:25:55,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 19:25:55,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 19:25:55,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 19:25:55,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 19:25:55,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 19:25:55,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 19:25:55,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 19:25:55,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 19:25:55,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 19:25:55,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 19:25:55,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 19:25:55,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 19:25:55,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 19:25:55,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 19:25:55,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 19:25:55,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 19:25:55,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 19:25:55,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 19:25:55,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 19:25:55,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 19:25:55,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 19:25:55,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 19:25:55,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 19:25:55,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 19:25:55,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 19:25:55,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 19:25:55,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 19:25:55,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 19:25:55,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 19:25:55,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 19:25:55,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 19:25:55,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 19:25:55,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 19:25:55,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 19:25:55,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 19:25:55,806 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 19:25:55,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 19:25:55,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 19:25:55,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 19:25:55,811 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 19:25:55,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 19:25:55,812 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 19:25:55,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 19:25:55,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 19:25:55,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 19:25:55,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 19:25:55,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 19:25:55,814 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 19:25:55,815 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 19:25:55,815 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 19:25:55,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 19:25:55,815 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 19:25:55,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 19:25:55,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 19:25:55,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 19:25:55,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 19:25:55,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 19:25:55,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 19:25:55,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 19:25:55,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 19:25:55,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 19:25:55,818 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 19:25:55,819 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 19:25:55,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 19:25:55,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 19:25:55,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 19:25:55,820 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 -> fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 [2020-12-02 19:25:56,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 19:25:56,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 19:25:56,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 19:25:56,362 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 19:25:56,363 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 19:25:56,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-12-02 19:25:56,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa3cfcad/3d5719dd05a14e2c9132fe00c3ee9a7b/FLAG8e281c16d [2020-12-02 19:25:57,149 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 19:25:57,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-12-02 19:25:57,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa3cfcad/3d5719dd05a14e2c9132fe00c3ee9a7b/FLAG8e281c16d [2020-12-02 19:25:57,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa3cfcad/3d5719dd05a14e2c9132fe00c3ee9a7b [2020-12-02 19:25:57,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 19:25:57,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 19:25:57,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 19:25:57,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 19:25:57,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 19:25:57,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10332f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57, skipping insertion in model container [2020-12-02 19:25:57,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,227 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 19:25:57,245 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 19:25:57,443 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2020-12-02 19:25:57,449 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:25:57,478 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 19:25:57,507 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2020-12-02 19:25:57,508 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 19:25:57,550 INFO L217 MainTranslator]: Completed translation [2020-12-02 19:25:57,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57 WrapperNode [2020-12-02 19:25:57,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 19:25:57,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 19:25:57,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 19:25:57,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 19:25:57,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 19:25:57,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 19:25:57,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 19:25:57,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 19:25:57,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... [2020-12-02 19:25:57,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 19:25:57,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 19:25:57,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 19:25:57,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 19:25:57,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 19:25:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 19:25:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 19:25:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 19:25:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 19:25:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 19:26:00,246 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 19:26:00,246 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-02 19:26:00,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:00 BoogieIcfgContainer [2020-12-02 19:26:00,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 19:26:00,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 19:26:00,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 19:26:00,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 19:26:00,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:25:57" (1/3) ... [2020-12-02 19:26:00,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74df7fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:26:00, skipping insertion in model container [2020-12-02 19:26:00,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:25:57" (2/3) ... [2020-12-02 19:26:00,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74df7fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:26:00, skipping insertion in model container [2020-12-02 19:26:00,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:26:00" (3/3) ... [2020-12-02 19:26:00,264 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2020-12-02 19:26:00,281 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 19:26:00,285 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 19:26:00,299 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 19:26:00,329 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 19:26:00,329 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 19:26:00,329 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 19:26:00,329 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 19:26:00,329 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 19:26:00,329 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 19:26:00,330 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 19:26:00,330 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 19:26:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-02 19:26:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-02 19:26:00,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:26:00,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-02 19:26:00,353 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:26:00,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:26:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-02 19:26:00,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:26:00,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842640775] [2020-12-02 19:26:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 19:26:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 19:26:01,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 19:26:01,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:26:03,603 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (exists ((|v_ULTIMATE.start_main_#t~nondet8_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_6|)))) (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse0))))) is different from false [2020-12-02 19:26:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 19:26:03,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:26:05,904 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x~0_7 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_7 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_7))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_7) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_7) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_7))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_6|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (= .cse1 (fp.div c_~CRM .cse0 .cse2))) (not (fp.eq .cse1 .cse0)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2))))) is different from true [2020-12-02 19:26:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 19:26:05,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842640775] [2020-12-02 19:26:05,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 19:26:05,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-12-02 19:26:05,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658357295] [2020-12-02 19:26:05,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 19:26:05,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:26:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 19:26:05,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2020-12-02 19:26:05,930 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 6 states. [2020-12-02 19:26:10,427 WARN L197 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 34 [2020-12-02 19:26:12,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= roundNearestTiesToEven c_~CRM) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse0)) (exists ((|v_ULTIMATE.start_main_#t~nondet8_6| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_6|)))) (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse1)))))) is different from false [2020-12-02 19:26:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 19:26:17,220 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-12-02 19:26:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 19:26:17,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-12-02 19:26:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 19:26:17,232 INFO L225 Difference]: With dead ends: 16 [2020-12-02 19:26:17,232 INFO L226 Difference]: Without dead ends: 7 [2020-12-02 19:26:17,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14, Invalid=14, Unknown=4, NotChecked=24, Total=56 [2020-12-02 19:26:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-12-02 19:26:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-12-02 19:26:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-12-02 19:26:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-12-02 19:26:17,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-12-02 19:26:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 19:26:17,274 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-12-02 19:26:17,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 19:26:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-12-02 19:26:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-02 19:26:17,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:26:17,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-02 19:26:17,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 19:26:17,491 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:26:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:26:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-12-02 19:26:17,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:26:17,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783979838] [2020-12-02 19:26:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 19:26:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 19:26:19,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-02 19:26:19,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:26:21,350 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1))))) is different from false [2020-12-02 19:26:23,750 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|)))) (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse0)))) (exists ((v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1))))) is different from false [2020-12-02 19:26:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-12-02 19:26:23,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:26:26,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (fp.eq .cse0 .cse1)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)) (not (= (fp.div c_~CRM .cse1 .cse2) .cse0))))) is different from false [2020-12-02 19:26:28,612 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (fp.eq .cse0 .cse1)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)) (not (= (fp.div c_~CRM .cse1 .cse2) .cse0))))) is different from true [2020-12-02 19:26:31,045 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_10))) (.cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (or (not (= .cse0 .cse1)) (not (= (fp.div c_~CRM .cse2 .cse1) .cse3)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4)) (not (fp.eq .cse3 .cse2)) (not (= .cse2 (fp.div c_~CRM .cse4 .cse5))) (not (= .cse0 .cse5))))) is different from true [2020-12-02 19:26:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-12-02 19:26:31,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783979838] [2020-12-02 19:26:31,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 19:26:31,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-12-02 19:26:31,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769693132] [2020-12-02 19:26:31,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 19:26:31,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:26:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 19:26:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2020-12-02 19:26:31,051 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-12-02 19:26:35,991 WARN L197 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 49 [2020-12-02 19:26:38,798 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (fp.eq .cse0 .cse1)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)) (not (= (fp.div c_~CRM .cse1 .cse2) .cse0))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse3 .cse4)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse4)))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from false [2020-12-02 19:26:41,536 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_9 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_9)))) (or (not (fp.eq .cse0 .cse1)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)) (not (= (fp.div c_~CRM .cse1 .cse2) .cse0))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse3 .cse4)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse4)))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-12-02 19:26:43,943 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet10_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_6|)))) (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse0)))) (exists ((v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_8|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse1)))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from false [2020-12-02 19:26:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 19:26:48,527 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-12-02 19:26:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 19:26:48,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-12-02 19:26:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 19:26:48,529 INFO L225 Difference]: With dead ends: 11 [2020-12-02 19:26:48,529 INFO L226 Difference]: Without dead ends: 8 [2020-12-02 19:26:48,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=20, Invalid=15, Unknown=9, NotChecked=66, Total=110 [2020-12-02 19:26:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-02 19:26:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-02 19:26:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-02 19:26:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-12-02 19:26:48,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-12-02 19:26:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 19:26:48,536 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-12-02 19:26:48,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 19:26:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-12-02 19:26:48,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-02 19:26:48,537 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:26:48,537 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-12-02 19:26:48,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 19:26:48,739 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:26:48,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:26:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-12-02 19:26:48,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:26:48,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512552918] [2020-12-02 19:26:48,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 19:26:51,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-02 19:26:51,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 19:26:51,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-02 19:26:51,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:26:53,661 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1))))) is different from false [2020-12-02 19:26:56,128 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= .cse3 .cse1) (= (fp.div c_~CRM .cse2 .cse4) .cse0) (= .cse3 .cse4))))) is different from false [2020-12-02 19:26:58,913 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_12 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_12))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1) (= (fp.div c_~CRM .cse0 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse4 .cse3) (= .cse4 .cse2)))) (exists ((|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse5) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse5)))))) is different from false [2020-12-02 19:26:58,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 19:26:58,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-12-02 19:26:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-02 19:26:59,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:26:59,361 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 19:27:01,584 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse0)) (not (fp.eq .cse1 .cse2)) (not (= .cse1 (fp.div c_~CRM .cse2 .cse0))))))) is different from true [2020-12-02 19:27:04,027 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_14))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= .cse0 .cse1)) (not (= .cse0 .cse2)) (not (fp.eq .cse3 .cse4)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2) .cse4)) (fp.eq .cse4 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (fp.div c_~CRM .cse4 .cse1)))))) is different from true [2020-12-02 19:27:06,966 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_15 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_15))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_14)))) (or (not (= .cse0 .cse1)) (not (= .cse0 .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3)) (not (= .cse0 .cse4)) (not (fp.eq .cse5 .cse6)) (not (= (fp.div c_~CRM .cse3 .cse1) .cse7)) (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse5 (fp.div c_~CRM .cse6 .cse2))) (not (= (fp.div c_~CRM .cse7 .cse4) .cse6))))) is different from true [2020-12-02 19:27:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-02 19:27:06,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512552918] [2020-12-02 19:27:06,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 19:27:06,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-12-02 19:27:06,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590549502] [2020-12-02 19:27:06,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 19:27:06,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:27:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 19:27:06,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=6, NotChecked=66, Total=110 [2020-12-02 19:27:06,974 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2020-12-02 19:27:12,846 WARN L197 SmtUtils]: Spent 2.90 s on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 19:27:15,098 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0) (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_14))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= .cse2 .cse3)) (not (= .cse2 .cse4)) (not (fp.eq .cse5 .cse6)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse4) .cse6)) (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse5 (fp.div c_~CRM .cse6 .cse3)))))) (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse7))))) is different from false [2020-12-02 19:27:17,542 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse0)) (not (fp.eq .cse1 .cse2)) (not (= .cse1 (fp.div c_~CRM .cse2 .cse0))))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= .cse6 .cse4) (= (fp.div c_~CRM .cse5 .cse7) .cse3) (= .cse6 .cse7))))) is different from false [2020-12-02 19:27:19,738 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_13))) (.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (or (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse0)) (not (fp.eq .cse1 .cse2)) (not (= .cse1 (fp.div c_~CRM .cse2 .cse0))))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= .cse6 .cse4) (= (fp.div c_~CRM .cse5 .cse7) .cse3) (= .cse6 .cse7))))) is different from true [2020-12-02 19:27:22,553 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_12 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_11))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_12))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_9|))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_10|)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1) (= (fp.div c_~CRM .cse0 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse4 .cse3) (= .cse4 .cse2)))) (exists ((|v_ULTIMATE.start_main_#t~nondet10_10| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_10|)))) (and (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse5) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse5))))) (let ((.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))))) is different from false [2020-12-02 19:27:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 19:27:27,195 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-12-02 19:27:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 19:27:27,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2020-12-02 19:27:27,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 19:27:27,196 INFO L225 Difference]: With dead ends: 12 [2020-12-02 19:27:27,196 INFO L226 Difference]: Without dead ends: 9 [2020-12-02 19:27:27,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=28, Invalid=27, Unknown=11, NotChecked=144, Total=210 [2020-12-02 19:27:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-12-02 19:27:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-12-02 19:27:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-12-02 19:27:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-12-02 19:27:27,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-12-02 19:27:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 19:27:27,202 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-12-02 19:27:27,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 19:27:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-12-02 19:27:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-02 19:27:27,202 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 19:27:27,202 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-12-02 19:27:27,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 19:27:27,406 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 19:27:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 19:27:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-12-02 19:27:27,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 19:27:27,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746846375] [2020-12-02 19:27:27,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 19:27:30,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-02 19:27:30,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 19:27:30,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-02 19:27:30,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 19:27:33,117 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp.div c_~CRM .cse0 .cse1)) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse1) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0))))) is different from false [2020-12-02 19:27:35,590 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_16 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_16))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|)))) (and (= .cse0 .cse1) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= (fp.div c_~CRM .cse2 .cse1) .cse3) (= .cse4 .cse0) (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))))))) is different from false [2020-12-02 19:27:38,487 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_17 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_16))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_17))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|)))) (and (= .cse0 .cse1) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= (fp.div c_~CRM .cse2 .cse1) .cse3) (= .cse4 .cse0) (= .cse5 .cse0) (= (fp.div c_~CRM .cse3 .cse5) .cse6) (= (fp.div c_~CRM .cse6 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))))))) is different from false [2020-12-02 19:27:42,336 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_17 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_18 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_16))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_17))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_18))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse3 .cse4) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= (fp.div c_~CRM .cse5 .cse4) .cse0) (= .cse6 .cse3) (= .cse1 .cse3) (= (fp.div c_~CRM .cse2 .cse6) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|)))) (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) .cse7) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse7)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 19:27:42,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 19:27:42,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-02 19:27:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-12-02 19:27:42,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 19:27:42,865 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 19:27:45,128 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 .cse2) .cse0)) (not (= ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)) .cse2)))))) is different from true [2020-12-02 19:27:47,565 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_20)))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse1 .cse2)) (not (fp.eq .cse3 .cse0)) (not (= (fp.div c_~CRM .cse0 .cse4) .cse3)) (not (= .cse2 .cse4)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse0))))) is different from true [2020-12-02 19:27:50,234 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_20))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_21))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse2 .cse3)) (not (fp.eq .cse4 .cse0)) (not (= (fp.div c_~CRM .cse0 .cse5) .cse4)) (not (= .cse3 .cse5)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))) (not (= .cse6 .cse3))))) is different from true [2020-12-02 19:27:53,895 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_16| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_22 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet10_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_12| (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_21))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_20))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_16|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_16|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet10_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet10_14|))) (.cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse9 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_12|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_22)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse1 (fp.div c_~CRM .cse3 .cse4))) (not (= .cse2 .cse5)) (not (= .cse5 .cse6)) (not (fp.eq .cse7 .cse0)) (not (= (fp.div c_~CRM .cse0 .cse8) .cse7)) (not (= .cse5 .cse8)) (not (= .cse9 ((_ to_fp 11 53) c_~CRM 1.0))) (not (= .cse4 .cse5)) (not (= (fp.div c_~CRM .cse9 .cse6) .cse3))))) is different from true [2020-12-02 19:27:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-12-02 19:27:53,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746846375] [2020-12-02 19:27:53,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 19:27:53,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-12-02 19:27:53,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565354426] [2020-12-02 19:27:53,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-02 19:27:53,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 19:27:53,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-02 19:27:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=21, Unknown=8, NotChecked=104, Total=156 [2020-12-02 19:27:53,900 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2020-12-02 19:27:56,718 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-02 19:27:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 19:27:56,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 19:27:56,921 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:934) 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-02 19:27:56,928 INFO L168 Benchmark]: Toolchain (without parser) took 119740.11 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.7 MB in the beginning and 21.6 MB in the end (delta: -1.9 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-12-02 19:27:56,929 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 22.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 19:27:56,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.97 ms. Allocated memory is still 41.9 MB. Free memory was 19.5 MB in the beginning and 20.5 MB in the end (delta: -986.5 kB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-12-02 19:27:56,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.57 ms. Allocated memory is still 41.9 MB. Free memory was 20.4 MB in the beginning and 18.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 19:27:56,932 INFO L168 Benchmark]: Boogie Preprocessor took 72.87 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.9 MB in the beginning and 35.7 MB in the end (delta: -16.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-12-02 19:27:56,932 INFO L168 Benchmark]: RCFGBuilder took 2543.54 ms. Allocated memory is still 50.3 MB. Free memory was 35.6 MB in the beginning and 23.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-02 19:27:56,933 INFO L168 Benchmark]: TraceAbstraction took 116676.57 ms. Allocated memory is still 50.3 MB. Free memory was 23.3 MB in the beginning and 21.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2020-12-02 19:27:56,937 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.23 ms. Allocated memory is still 41.9 MB. Free memory was 22.5 MB in the beginning and 22.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 360.97 ms. Allocated memory is still 41.9 MB. Free memory was 19.5 MB in the beginning and 20.5 MB in the end (delta: -986.5 kB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.57 ms. Allocated memory is still 41.9 MB. Free memory was 20.4 MB in the beginning and 18.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.87 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.9 MB in the beginning and 35.7 MB in the end (delta: -16.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2543.54 ms. Allocated memory is still 50.3 MB. Free memory was 35.6 MB in the beginning and 23.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 116676.57 ms. Allocated memory is still 50.3 MB. Free memory was 23.3 MB in the beginning and 21.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.2 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...