./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 ...................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.23-635dfa2 [2018-12-08 08:43:40,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:43:40,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:43:40,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:43:40,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:43:40,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:43:40,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:43:40,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:43:40,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:43:40,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:43:40,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:43:40,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:43:40,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:43:40,333 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:43:40,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:43:40,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:43:40,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:43:40,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:43:40,336 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:43:40,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:43:40,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:43:40,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:43:40,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:43:40,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:43:40,340 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:43:40,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:43:40,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:43:40,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:43:40,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:43:40,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:43:40,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:43:40,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:43:40,343 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:43:40,343 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:43:40,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:43:40,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:43:40,344 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 08:43:40,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:43:40,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:43:40,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 08:43:40,352 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 08:43:40,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:43:40,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:43:40,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 08:43:40,353 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 08:43:40,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:43:40,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 08:43:40,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 08:43:40,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:43:40,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 08:43:40,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 08:43:40,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer 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(__VERIFIER_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 -> be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 [2018-12-08 08:43:40,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:43:40,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:43:40,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:43:40,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:43:40,385 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:43:40,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-08 08:43:40,427 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/e56fc8f4c/195a4b8763a149d5b51ae426840d25b8/FLAGb283ed1d5 [2018-12-08 08:43:40,856 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:43:40,856 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-08 08:43:40,859 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/e56fc8f4c/195a4b8763a149d5b51ae426840d25b8/FLAGb283ed1d5 [2018-12-08 08:43:40,867 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/e56fc8f4c/195a4b8763a149d5b51ae426840d25b8 [2018-12-08 08:43:40,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:43:40,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:43:40,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:43:40,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:43:40,872 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:43:40,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:40,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b368404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40, skipping insertion in model container [2018-12-08 08:43:40,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:40,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:43:40,886 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:43:40,967 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:43:40,970 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:43:40,979 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:43:40,986 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:43:40,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40 WrapperNode [2018-12-08 08:43:40,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:43:40,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:43:40,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:43:40,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:43:40,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:40,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:40,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:43:40,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:43:40,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:43:40,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:43:41,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... [2018-12-08 08:43:41,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:43:41,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:43:41,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:43:41,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:43:41,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/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 [2018-12-08 08:43:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 08:43:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 08:43:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:43:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:43:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 08:43:41,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 08:43:41,144 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:43:41,145 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 08:43:41,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:43:41 BoogieIcfgContainer [2018-12-08 08:43:41,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:43:41,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 08:43:41,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 08:43:41,147 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 08:43:41,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:43:40" (1/3) ... [2018-12-08 08:43:41,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47489a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:43:41, skipping insertion in model container [2018-12-08 08:43:41,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:40" (2/3) ... [2018-12-08 08:43:41,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47489a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:43:41, skipping insertion in model container [2018-12-08 08:43:41,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:43:41" (3/3) ... [2018-12-08 08:43:41,149 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-08 08:43:41,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 08:43:41,159 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 08:43:41,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 08:43:41,186 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:43:41,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 08:43:41,186 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 08:43:41,187 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 08:43:41,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:43:41,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:43:41,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 08:43:41,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:43:41,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 08:43:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-08 08:43:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 08:43:41,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:43:41,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:43:41,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:43:41,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:43:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-12-08 08:43:41,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:43:41,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:43:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:43:41,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:43:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:43:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:43:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:43:41,272 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 08:43:41,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:43:41 BoogieIcfgContainer [2018-12-08 08:43:41,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 08:43:41,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:43:41,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:43:41,286 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:43:41,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:43:41" (3/4) ... [2018-12-08 08:43:41,289 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:43:41,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:43:41,289 INFO L168 Benchmark]: Toolchain (without parser) took 420.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.4 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 892.5 kB. Max. memory is 11.5 GB. [2018-12-08 08:43:41,290 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:43:41,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.84 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:43:41,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:43:41,291 INFO L168 Benchmark]: Boogie Preprocessor took 10.77 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:43:41,291 INFO L168 Benchmark]: RCFGBuilder took 135.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:43:41,292 INFO L168 Benchmark]: TraceAbstraction took 140.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:43:41,292 INFO L168 Benchmark]: Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:43:41,294 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.84 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.77 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 135.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 140.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 25]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 10, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=2, __return_main=0] [L7] float main__x = 1.0; [L8] float main__x1 = main__x / 2.5; VAL [__return_main=0, main__x=1] [L10] COND FALSE !(main__x1 != main__x) [L19] int __tmp_1; [L20] __tmp_1 = main__x == 0 [L21] int __VERIFIER_assert__cond; [L22] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L23] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] [L25] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__x=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.1.23-635dfa2 [2018-12-08 08:43:42,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:43:42,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:43:42,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:43:42,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:43:42,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:43:42,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:43:42,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:43:42,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:43:42,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:43:42,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:43:42,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:43:42,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:43:42,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:43:42,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:43:42,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:43:42,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:43:42,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:43:42,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:43:42,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:43:42,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:43:42,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:43:42,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:43:42,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:43:42,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:43:42,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:43:42,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:43:42,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:43:42,629 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:43:42,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:43:42,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:43:42,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:43:42,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:43:42,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:43:42,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:43:42,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:43:42,631 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-08 08:43:42,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:43:42,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:43:42,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 08:43:42,639 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 08:43:42,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:43:42,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 08:43:42,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:43:42,641 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 08:43:42,641 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 08:43:42,642 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 08:43:42,642 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 08:43:42,643 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 08:43:42,643 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 08:43:42,643 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 08:43:42,643 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer 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(__VERIFIER_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 -> be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 [2018-12-08 08:43:42,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:43:42,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:43:42,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:43:42,670 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:43:42,671 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:43:42,671 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-08 08:43:42,706 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/8a4bc4e55/e0b5bbf030ae4f1b8701ca875f225505/FLAG91f335d68 [2018-12-08 08:43:43,062 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:43:43,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-08 08:43:43,065 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/8a4bc4e55/e0b5bbf030ae4f1b8701ca875f225505/FLAG91f335d68 [2018-12-08 08:43:43,434 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/data/8a4bc4e55/e0b5bbf030ae4f1b8701ca875f225505 [2018-12-08 08:43:43,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:43:43,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:43:43,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:43:43,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:43:43,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:43:43,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a847288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43, skipping insertion in model container [2018-12-08 08:43:43,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:43:43,459 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:43:43,551 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:43:43,555 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:43:43,564 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:43:43,573 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:43:43,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43 WrapperNode [2018-12-08 08:43:43,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:43:43,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:43:43,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:43:43,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:43:43,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:43:43,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:43:43,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:43:43,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:43:43,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... [2018-12-08 08:43:43,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:43:43,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:43:43,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:43:43,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:43:43,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/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 [2018-12-08 08:43:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 08:43:43,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 08:43:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:43:43,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:43:43,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 08:43:43,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 08:43:45,908 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:43:45,909 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 08:43:45,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:43:45 BoogieIcfgContainer [2018-12-08 08:43:45,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:43:45,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 08:43:45,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 08:43:45,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 08:43:45,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:43:43" (1/3) ... [2018-12-08 08:43:45,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2a5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:43:45, skipping insertion in model container [2018-12-08 08:43:45,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:43:43" (2/3) ... [2018-12-08 08:43:45,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2a5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:43:45, skipping insertion in model container [2018-12-08 08:43:45,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:43:45" (3/3) ... [2018-12-08 08:43:45,914 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-08 08:43:45,919 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 08:43:45,923 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 08:43:45,932 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 08:43:45,948 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:43:45,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 08:43:45,948 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 08:43:45,948 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 08:43:45,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:43:45,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:43:45,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 08:43:45,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:43:45,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 08:43:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-08 08:43:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 08:43:45,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:43:45,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:43:45,963 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:43:45,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:43:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-12-08 08:43:45,969 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:43:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/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 [2018-12-08 08:43:45,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:43:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:43:46,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:43:53,630 WARN L180 SmtUtils]: Spent 5.36 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-08 08:43:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:43:53,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 08:43:53,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:43:53,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 08:43:53,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 08:43:53,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 08:43:53,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:43:53,664 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-12-08 08:43:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:43:57,222 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-08 08:43:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 08:43:57,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 08:43:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:43:57,430 INFO L225 Difference]: With dead ends: 22 [2018-12-08 08:43:57,431 INFO L226 Difference]: Without dead ends: 11 [2018-12-08 08:43:57,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 08:43:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-08 08:43:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-08 08:43:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 08:43:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-08 08:43:57,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-08 08:43:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:43:57,459 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-08 08:43:57,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 08:43:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-08 08:43:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 08:43:57,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:43:57,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:43:57,460 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:43:57,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:43:57,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-12-08 08:43:57,461 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:43:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/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 [2018-12-08 08:43:57,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:43:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:43:57,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:44:00,074 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))))) is different from true [2018-12-08 08:44:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-08 08:44:00,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:44:02,294 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-12-08 08:44:04,502 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from true [2018-12-08 08:44:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-08 08:44:04,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:44:04,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-08 08:44:04,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 08:44:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:44:04,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=8, Unknown=3, NotChecked=10, Total=30 [2018-12-08 08:44:04,528 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-12-08 08:44:06,742 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-08 08:44:08,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))))) is different from true [2018-12-08 08:44:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:44:09,930 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-08 08:44:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 08:44:09,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-08 08:44:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:44:09,931 INFO L225 Difference]: With dead ends: 15 [2018-12-08 08:44:09,932 INFO L226 Difference]: Without dead ends: 12 [2018-12-08 08:44:09,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2018-12-08 08:44:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-08 08:44:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-08 08:44:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 08:44:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-08 08:44:09,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-08 08:44:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:44:09,937 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-08 08:44:09,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 08:44:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-08 08:44:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 08:44:09,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:44:09,937 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:44:09,937 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:44:09,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:44:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-12-08 08:44:09,938 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:44:09,938 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/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 [2018-12-08 08:44:09,942 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 08:44:10,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:44:10,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:44:10,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:44:12,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x~0) (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))))) is different from true [2018-12-08 08:44:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 08:44:12,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:44:15,013 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-12-08 08:44:18,205 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:44:20,586 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:44:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-12-08 08:44:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:44:20,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-08 08:44:20,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 08:44:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 08:44:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=30, Total=72 [2018-12-08 08:44:20,616 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-12-08 08:44:23,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse2)))) (or (fp.eq .cse1 .cse0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse2)) .cse1)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-12-08 08:44:29,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x~0) (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))))) is different from true [2018-12-08 08:44:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:44:31,730 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-08 08:44:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:44:31,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-08 08:44:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:44:31,731 INFO L225 Difference]: With dead ends: 16 [2018-12-08 08:44:31,731 INFO L226 Difference]: Without dead ends: 13 [2018-12-08 08:44:31,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=19, Invalid=25, Unknown=6, NotChecked=60, Total=110 [2018-12-08 08:44:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-08 08:44:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-08 08:44:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 08:44:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-08 08:44:31,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-08 08:44:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:44:31,735 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-08 08:44:31,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 08:44:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-08 08:44:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 08:44:31,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:44:31,736 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:44:31,736 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:44:31,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:44:31,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-12-08 08:44:31,736 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:44:31,736 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/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 [2018-12-08 08:44:31,740 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-08 08:44:32,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 08:44:32,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:44:32,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:44:44,594 WARN L180 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-08 08:44:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:44:44,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:44:51,280 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-12-08 08:44:53,500 WARN L854 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) is different from true [2018-12-08 08:44:55,915 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:44:58,333 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:45:00,933 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:45:03,535 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:45:03,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-08 08:45:03,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:45:03,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-08 08:45:03,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 08:45:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 08:45:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=37, Unknown=11, NotChecked=42, Total=110 [2018-12-08 08:45:03,566 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-12-08 08:45:06,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse2))) .cse2)))) (or (fp.eq .cse1 .cse0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse2)) .cse1)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-12-08 08:45:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:45:23,762 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-08 08:45:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:45:23,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-12-08 08:45:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:45:23,763 INFO L225 Difference]: With dead ends: 17 [2018-12-08 08:45:23,763 INFO L226 Difference]: Without dead ends: 14 [2018-12-08 08:45:23,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=22, Invalid=38, Unknown=12, NotChecked=60, Total=132 [2018-12-08 08:45:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-08 08:45:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-08 08:45:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-08 08:45:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-08 08:45:23,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-08 08:45:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:45:23,767 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-08 08:45:23,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 08:45:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-08 08:45:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 08:45:23,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:45:23,768 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:45:23,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:45:23,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:45:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-12-08 08:45:23,769 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:45:23,769 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-08 08:45:23,773 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 08:45:24,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 08:45:24,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:45:24,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:45:27,042 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x~0) (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))))) is different from true [2018-12-08 08:45:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-08 08:45:27,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:45:29,284 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-12-08 08:45:31,498 WARN L854 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from true [2018-12-08 08:45:33,943 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:45:36,369 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:45:38,994 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:45:41,628 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:45:44,445 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:45:47,258 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:45:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2018-12-08 08:45:47,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:45:47,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-08 08:45:47,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 08:45:47,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 08:45:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=32, Unknown=9, NotChecked=70, Total=132 [2018-12-08 08:45:47,298 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-12-08 08:45:50,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:45:52,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:45:55,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:45:57,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-12-08 08:45:59,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x~0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))))) is different from true [2018-12-08 08:46:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:46:04,529 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-08 08:46:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 08:46:04,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-12-08 08:46:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:46:04,530 INFO L225 Difference]: With dead ends: 18 [2018-12-08 08:46:04,530 INFO L226 Difference]: Without dead ends: 15 [2018-12-08 08:46:04,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=31, Invalid=37, Unknown=14, NotChecked=190, Total=272 [2018-12-08 08:46:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-08 08:46:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-08 08:46:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-08 08:46:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-08 08:46:04,534 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-08 08:46:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:46:04,534 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-08 08:46:04,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 08:46:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-08 08:46:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 08:46:04,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:46:04,535 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:46:04,535 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:46:04,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:46:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-12-08 08:46:04,536 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:46:04,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-08 08:46:04,540 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-08 08:46:05,890 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-08 08:46:05,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:46:05,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:46:08,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-12-08 08:46:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-12-08 08:46:08,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:46:10,479 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-12-08 08:46:14,162 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:46:16,610 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:46:19,254 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:46:21,911 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:46:24,792 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:46:27,653 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:46:30,685 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:46:33,731 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:46:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-12-08 08:46:33,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:46:33,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-08 08:46:33,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 08:46:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 08:46:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=45, Unknown=10, NotChecked=102, Total=182 [2018-12-08 08:46:33,776 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-08 08:46:36,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:46:39,742 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:46:42,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:46:44,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:46:47,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-08 08:46:49,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) .cse0))) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-12-08 08:47:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:47:00,919 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-08 08:47:00,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:47:00,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-08 08:47:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:47:00,920 INFO L225 Difference]: With dead ends: 19 [2018-12-08 08:47:00,920 INFO L226 Difference]: Without dead ends: 16 [2018-12-08 08:47:00,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=37, Invalid=51, Unknown=16, NotChecked=276, Total=380 [2018-12-08 08:47:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-08 08:47:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-08 08:47:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-08 08:47:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-08 08:47:00,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-08 08:47:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:47:00,925 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-08 08:47:00,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 08:47:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-08 08:47:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 08:47:00,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:47:00,926 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:47:00,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:47:00,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:47:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-12-08 08:47:00,927 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:47:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-08 08:47:00,930 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-08 08:47:02,380 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-08 08:47:02,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:47:02,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:47:22,877 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-08 08:47:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:47:22,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:47:29,605 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-12-08 08:47:33,009 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:47:35,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:47:38,100 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:47:40,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:47:43,658 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:47:46,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:47:49,644 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:47:52,737 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:47:56,036 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:47:59,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:47:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2018-12-08 08:47:59,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:47:59,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-12-08 08:47:59,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 08:47:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 08:47:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=83, Unknown=19, NotChecked=138, Total=272 [2018-12-08 08:47:59,400 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-12-08 08:48:02,711 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (fp.eq c_main_~main__x~0 .cse0) (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse2))) .cse2))) .cse2))) .cse2))) .cse2)))) (or (fp.eq .cse1 .cse0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse2)) .cse1)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse2)) c_main_~main__x1~0))) is different from true [2018-12-08 08:48:05,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-08 08:48:08,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-08 08:48:11,475 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1)))))) is different from true [2018-12-08 08:48:13,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-08 08:48:16,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-08 08:48:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:48:27,984 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-08 08:48:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 08:48:27,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-12-08 08:48:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:48:27,985 INFO L225 Difference]: With dead ends: 20 [2018-12-08 08:48:27,985 INFO L226 Difference]: Without dead ends: 17 [2018-12-08 08:48:27,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=44, Invalid=89, Unknown=25, NotChecked=348, Total=506 [2018-12-08 08:48:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-08 08:48:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-08 08:48:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 08:48:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-08 08:48:27,991 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-08 08:48:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:48:27,991 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-08 08:48:27,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 08:48:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-08 08:48:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 08:48:27,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:48:27,992 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:48:27,993 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:48:27,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:48:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-12-08 08:48:27,993 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:48:27,993 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-08 08:48:27,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:48:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:48:29,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:48:49,140 WARN L180 SmtUtils]: Spent 4.26 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-08 08:48:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:48:49,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:48:53,560 WARN L832 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) is different from false [2018-12-08 08:48:56,989 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:48:59,421 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:49:02,079 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:49:04,735 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:49:07,615 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:49:10,503 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:49:13,614 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:49:16,730 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:49:20,056 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:49:23,392 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:49:27,033 WARN L832 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from false [2018-12-08 08:49:30,715 WARN L854 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))) is different from true [2018-12-08 08:49:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2018-12-08 08:49:30,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 08:49:30,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-12-08 08:49:30,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 08:49:30,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 08:49:30,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=87, Unknown=17, NotChecked=168, Total=306 [2018-12-08 08:49:30,766 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 18 states. [2018-12-08 08:49:34,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (not (fp.eq c_main_~main__x1~0 c_main_~main__x~0)) (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-08 08:49:37,853 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:49:41,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:49:43,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:49:46,638 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:49:49,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)))) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) .cse0)) .cse1))))) is different from true [2018-12-08 08:49:51,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse0)) c_main_~main__x1~0)))) is different from true [2018-12-08 08:50:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:50:02,817 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-08 08:50:02,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 08:50:02,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-12-08 08:50:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 08:50:02,818 INFO L225 Difference]: With dead ends: 21 [2018-12-08 08:50:02,818 INFO L226 Difference]: Without dead ends: 18 [2018-12-08 08:50:02,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.6s TimeCoverageRelationStatistics Valid=48, Invalid=94, Unknown=24, NotChecked=434, Total=600 [2018-12-08 08:50:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-08 08:50:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-08 08:50:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 08:50:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-08 08:50:02,824 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-08 08:50:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 08:50:02,824 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-08 08:50:02,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 08:50:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-08 08:50:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 08:50:02,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 08:50:02,825 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:50:02,825 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 08:50:02,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:50:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2018-12-08 08:50:02,826 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-08 08:50:02,826 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f2a1e0f-d7ae-44a3-adab-741646dbaef0/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-08 08:50:02,829 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 08:50:04,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 08:50:04,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 08:50:04,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:50:26,969 WARN L180 SmtUtils]: Spent 6.73 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-08 08:50:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:50:26,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 08:50:32,571 WARN L832 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) c_main_~main__x1~0)) (fp.eq c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) is different from false [2018-12-08 08:50:36,041 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:50:38,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:50:41,154 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:50:43,850 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:50:46,779 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:50:49,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:50:52,822 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:50:55,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:50:59,337 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2018-12-08 08:51:02,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2018-12-08 08:51:04,610 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 08:51:04,811 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2018-12-08 08:51:04,812 FATAL L265 ToolchainWalker]: 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:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 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:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-12-08 08:51:04,816 INFO L168 Benchmark]: Toolchain (without parser) took 441379.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.4 MB in the beginning and 808.5 MB in the end (delta: 134.9 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:51:04,818 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:51:04,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.57 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:51:04,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.42 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:51:04,819 INFO L168 Benchmark]: Boogie Preprocessor took 17.47 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:51:04,819 INFO L168 Benchmark]: RCFGBuilder took 2303.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:51:04,820 INFO L168 Benchmark]: TraceAbstraction took 438906.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 808.5 MB in the end (delta: 289.4 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. [2018-12-08 08:51:04,822 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.57 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.42 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.47 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2303.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 438906.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 808.5 MB in the end (delta: 289.4 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 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:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...