./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_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/config/TaipanReach.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_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan --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 Taipan --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_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/config/TaipanReach.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_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan --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 Taipan --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-02 12:49:52,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:49:52,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:49:52,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:49:52,450 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:49:52,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:49:52,451 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:49:52,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:49:52,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:49:52,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:49:52,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:49:52,454 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:49:52,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:49:52,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:49:52,456 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:49:52,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:49:52,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:49:52,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:49:52,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:49:52,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:49:52,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:49:52,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:49:52,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:49:52,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:49:52,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:49:52,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:49:52,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:49:52,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:49:52,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:49:52,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:49:52,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:49:52,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:49:52,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:49:52,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:49:52,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:49:52,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:49:52,466 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 12:49:52,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:49:52,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:49:52,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:49:52,475 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:49:52,475 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:49:52,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:49:52,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:49:52,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:49:52,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:49:52,477 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:49:52,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:49:52,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:49:52,478 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:49:52,478 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 [2018-12-02 12:49:52,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:49:52,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:49:52,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:49:52,505 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:49:52,505 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:49:52,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-02 12:49:52,543 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/aaf7b9029/de2aed073e1f41f786c0da3e15778ef6/FLAG446f89a5e [2018-12-02 12:49:52,851 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:49:52,851 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-02 12:49:52,855 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/aaf7b9029/de2aed073e1f41f786c0da3e15778ef6/FLAG446f89a5e [2018-12-02 12:49:52,862 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/aaf7b9029/de2aed073e1f41f786c0da3e15778ef6 [2018-12-02 12:49:52,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:49:52,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:49:52,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:49:52,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:49:52,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:49:52,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:52,870 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 02.12 12:49:52, skipping insertion in model container [2018-12-02 12:49:52,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:52,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:49:52,882 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:49:52,963 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:49:52,966 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:49:52,975 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:49:52,982 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:49:52,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52 WrapperNode [2018-12-02 12:49:52,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:49:52,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:49:52,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:49:52,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:49:52,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:52,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:52,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:49:52,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:49:52,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:49:52,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:49:53,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... [2018-12-02 12:49:53,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:49:53,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:49:53,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:49:53,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:49:53,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:49:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:49:53,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:49:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:49:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:49:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:49:53,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:49:53,158 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:49:53,158 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 12:49:53,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:53 BoogieIcfgContainer [2018-12-02 12:49:53,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:49:53,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:49:53,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:49:53,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:49:53,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:49:52" (1/3) ... [2018-12-02 12:49:53,162 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 02.12 12:49:53, skipping insertion in model container [2018-12-02 12:49:53,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:52" (2/3) ... [2018-12-02 12:49:53,163 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 02.12 12:49:53, skipping insertion in model container [2018-12-02 12:49:53,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:53" (3/3) ... [2018-12-02 12:49:53,164 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-02 12:49:53,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:49:53,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 12:49:53,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 12:49:53,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:49:53,208 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:49:53,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:49:53,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:49:53,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:49:53,208 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:49:53,208 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:49:53,208 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:49:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-02 12:49:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 12:49:53,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:53,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:53,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:49:53,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-12-02 12:49:53,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:49:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:49:53,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:49:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:49:53,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:49:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:49:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:49:53,296 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:49:53,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:49:53 BoogieIcfgContainer [2018-12-02 12:49:53,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:49:53,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:49:53,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:49:53,311 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:49:53,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:53" (3/4) ... [2018-12-02 12:49:53,314 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 12:49:53,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:49:53,314 INFO L168 Benchmark]: Toolchain (without parser) took 449.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 961.4 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:49:53,315 INFO L168 Benchmark]: CDTParser took 0.11 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-02 12:49:53,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.93 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-02 12:49:53,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.94 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-02 12:49:53,317 INFO L168 Benchmark]: Boogie Preprocessor took 11.07 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-02 12:49:53,317 INFO L168 Benchmark]: RCFGBuilder took 152.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:49:53,317 INFO L168 Benchmark]: TraceAbstraction took 151.01 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:49:53,318 INFO L168 Benchmark]: Witness Printer took 3.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:49:53,320 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.93 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.94 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 11.07 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 152.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 151.01 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. 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-02 12:49:54,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:49:54,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:49:54,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:49:54,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:49:54,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:49:54,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:49:54,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:49:54,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:49:54,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:49:54,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:49:54,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:49:54,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:49:54,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:49:54,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:49:54,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:49:54,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:49:54,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:49:54,651 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:49:54,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:49:54,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:49:54,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:49:54,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:49:54,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:49:54,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:49:54,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:49:54,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:49:54,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:49:54,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:49:54,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:49:54,659 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:49:54,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:49:54,659 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:49:54,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:49:54,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:49:54,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:49:54,661 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 12:49:54,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:49:54,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:49:54,672 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:49:54,672 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:49:54,673 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:49:54,673 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:49:54,673 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:49:54,673 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:49:54,673 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:49:54,673 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:49:54,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:49:54,674 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:49:54,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:49:54,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:49:54,674 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:49:54,674 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:49:54,674 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:49:54,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:49:54,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:49:54,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 12:49:54,676 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 12:49:54,676 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_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be771be9f49958c0d6d4d5ef96bf28c3ee3bd9a8 [2018-12-02 12:49:54,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:49:54,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:49:54,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:49:54,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:49:54,712 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:49:54,712 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-02 12:49:54,752 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/3b1efd921/e8c75beea169432ab40533fb07507a2d/FLAG476651fdf [2018-12-02 12:49:55,076 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:49:55,076 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/sv-benchmarks/c/floats-esbmc-regression/Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-02 12:49:55,079 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/3b1efd921/e8c75beea169432ab40533fb07507a2d/FLAG476651fdf [2018-12-02 12:49:55,485 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/data/3b1efd921/e8c75beea169432ab40533fb07507a2d [2018-12-02 12:49:55,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:49:55,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:49:55,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:49:55,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:49:55,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:49:55,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e029c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55, skipping insertion in model container [2018-12-02 12:49:55,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:49:55,511 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:49:55,600 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:49:55,604 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:49:55,613 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:49:55,622 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:49:55,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55 WrapperNode [2018-12-02 12:49:55,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:49:55,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:49:55,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:49:55,623 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:49:55,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:49:55,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:49:55,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:49:55,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:49:55,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... [2018-12-02 12:49:55,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:49:55,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:49:55,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:49:55,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:49:55,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:49:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:49:55,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:49:55,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:49:55,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:49:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:49:55,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:49:57,964 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:49:57,965 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 12:49:57,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:57 BoogieIcfgContainer [2018-12-02 12:49:57,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:49:57,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:49:57,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:49:57,968 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:49:57,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:49:55" (1/3) ... [2018-12-02 12:49:57,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f231c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:49:57, skipping insertion in model container [2018-12-02 12:49:57,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:49:55" (2/3) ... [2018-12-02 12:49:57,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f231c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:49:57, skipping insertion in model container [2018-12-02 12:49:57,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:49:57" (3/3) ... [2018-12-02 12:49:57,970 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_true-unreach-call.i.p+cfa-reducer.c [2018-12-02 12:49:57,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:49:57,981 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 12:49:57,991 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 12:49:58,008 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:49:58,008 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:49:58,009 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:49:58,009 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:49:58,009 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:49:58,009 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:49:58,009 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:49:58,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:49:58,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:49:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-02 12:49:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 12:49:58,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:49:58,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:49:58,024 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:49:58,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:49:58,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2018-12-02 12:49:58,029 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:49:58,030 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-02 12:49:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:49:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:49:58,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:00,449 WARN L854 $PredicateComparison]: unable to prove that (and (= c_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (= c_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2018-12-02 12:50:00,457 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-02 12:50:00,458 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 12:50:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:50:00,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:50:00,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:50:00,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:50:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 12:50:00,484 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-12-02 12:50:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:00,496 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-02 12:50:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:50:00,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-02 12:50:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:00,502 INFO L225 Difference]: With dead ends: 22 [2018-12-02 12:50:00,502 INFO L226 Difference]: Without dead ends: 11 [2018-12-02 12:50:00,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 12:50:00,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-02 12:50:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 12:50:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 12:50:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-02 12:50:00,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-02 12:50:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:00,524 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-02 12:50:00,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:50:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-02 12:50:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 12:50:00,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:00,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:50:00,525 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:00,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2018-12-02 12:50:00,525 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:50:00,525 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-02 12:50:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:50:00,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:03,129 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-02 12:50:03,134 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-02 12:50:03,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:05,345 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-02 12:50:07,360 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-02 12:50:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:50:07,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:50:07,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:50:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-02 12:50:19,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:50:19,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-02 12:50:19,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:50:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:50:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2018-12-02 12:50:19,827 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-12-02 12:50:23,005 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-12-02 12:50:27,298 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-02 12:50:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:50:28,459 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-02 12:50:28,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:50:28,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-02 12:50:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:50:28,461 INFO L225 Difference]: With dead ends: 15 [2018-12-02 12:50:28,461 INFO L226 Difference]: Without dead ends: 12 [2018-12-02 12:50:28,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=15, Invalid=14, Unknown=3, NotChecked=24, Total=56 [2018-12-02 12:50:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-02 12:50:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-02 12:50:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 12:50:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-02 12:50:28,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-02 12:50:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:50:28,465 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-02 12:50:28,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:50:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-02 12:50:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 12:50:28,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:50:28,466 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:50:28,466 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:50:28,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:50:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2018-12-02 12:50:28,466 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:50:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-02 12:50:28,471 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 12:50:29,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:50:29,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:50:29,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:50:31,303 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-02 12:50:31,311 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-02 12:50:31,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:50:34,828 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-02 12:50:37,217 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-02 12:50:39,613 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-02 12:50:39,625 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-02 12:50:39,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:50:39,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:50:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:50:53,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:50:53,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-02 12:50:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:50:53,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-02 12:50:53,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:50:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:50:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=30, Total=72 [2018-12-02 12:50:53,848 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-12-02 12:50:56,245 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-02 12:51:03,472 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-02 12:51:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:51:07,181 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-02 12:51:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:51:07,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-12-02 12:51:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:51:07,182 INFO L225 Difference]: With dead ends: 16 [2018-12-02 12:51:07,182 INFO L226 Difference]: Without dead ends: 13 [2018-12-02 12:51:07,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=19, Invalid=25, Unknown=6, NotChecked=60, Total=110 [2018-12-02 12:51:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-02 12:51:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 12:51:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 12:51:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-02 12:51:07,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-02 12:51:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:51:07,187 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-02 12:51:07,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:51:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-02 12:51:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 12:51:07,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:51:07,187 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:51:07,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:51:07,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:51:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2018-12-02 12:51:07,188 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:51:07,189 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-02 12:51:07,192 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 12:51:08,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 12:51:08,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:51:08,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:51:10,356 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-12-02 12:51:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-12-02 12:51:10,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:51:12,630 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-02 12:51:14,840 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-02 12:51:17,258 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-02 12:51:19,683 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-02 12:51:22,297 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-02 12:51:24,919 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-02 12:51:24,934 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-02 12:51:24,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:51:24,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:51:24,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 12:51:50,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 12:51:50,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-02 12:51:51,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:51:51,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-02 12:51:51,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:51:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:51:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=32, Unknown=7, NotChecked=52, Total=110 [2018-12-02 12:51:51,435 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-12-02 12:51:54,087 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-02 12:51:56,524 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse1))) .cse1)) c_main_~main__x1~0))) is different from true [2018-12-02 12:51:58,747 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0)) c_main_~main__x1~0))) is different from true [2018-12-02 12:52:00,969 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))) (= 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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2018-12-02 12:52:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:52:03,796 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-02 12:52:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:52:03,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-12-02 12:52:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:52:03,798 INFO L225 Difference]: With dead ends: 17 [2018-12-02 12:52:03,798 INFO L226 Difference]: Without dead ends: 14 [2018-12-02 12:52:03,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=27, Invalid=36, Unknown=11, NotChecked=136, Total=210 [2018-12-02 12:52:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-02 12:52:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-02 12:52:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 12:52:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-02 12:52:03,802 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-02 12:52:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:52:03,802 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-02 12:52:03,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:52:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-02 12:52:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 12:52:03,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:52:03,803 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:52:03,803 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:52:03,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:52:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2018-12-02 12:52:03,803 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:52:03,803 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-02 12:52:03,807 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:52:04,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:52:04,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:52:04,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:52:19,089 WARN L180 SmtUtils]: Spent 4.97 s on a formula simplification that was a NOOP. DAG size: 26 [2018-12-02 12:52:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:52:19,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:52:23,572 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-02 12:52:25,799 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-02 12:52:28,249 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-02 12:52:30,679 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-02 12:52:33,337 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-02 12:52:36,007 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-02 12:52:38,837 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-02 12:52:41,693 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-02 12:52:41,712 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-02 12:52:41,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:52:41,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:52:41,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 12:53:05,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 12:53:05,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-02 12:53:06,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:53:06,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-02 12:53:06,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:53:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:53:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=39, Unknown=11, NotChecked=60, Total=132 [2018-12-02 12:53:06,819 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-12-02 12:53:09,675 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-02 12:53:12,323 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-02 12:53:14,766 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-02 12:53:16,992 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-02 12:53:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:53:24,121 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-02 12:53:24,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:53:24,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-12-02 12:53:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:53:24,123 INFO L225 Difference]: With dead ends: 18 [2018-12-02 12:53:24,123 INFO L226 Difference]: Without dead ends: 15 [2018-12-02 12:53:24,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=30, Invalid=43, Unknown=15, NotChecked=152, Total=240 [2018-12-02 12:53:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-02 12:53:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 12:53:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 12:53:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-02 12:53:24,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-02 12:53:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:53:24,128 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-02 12:53:24,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:53:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-02 12:53:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 12:53:24,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:53:24,128 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:53:24,128 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:53:24,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:53:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2018-12-02 12:53:24,129 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:53:24,129 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-02 12:53:24,134 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-02 12:53:25,507 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-02 12:53:25,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:53:25,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:53:45,400 WARN L180 SmtUtils]: Spent 6.73 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 12:53:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:53:45,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:53:49,873 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-02 12:53:53,339 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-02 12:53:55,776 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-02 12:53:58,421 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-02 12:54:01,074 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-02 12:54:03,941 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-02 12:54:06,817 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-02 12:54:09,881 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-02 12:54:12,957 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-02 12:54:12,978 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-02 12:54:13,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:54:13,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:54:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 12:54:52,634 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-02 12:54:52,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Forcibly destroying the process [2018-12-02 12:54:53,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:54:53,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-02 12:54:53,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 12:54:53,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 12:54:53,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=51, Unknown=15, NotChecked=90, Total=182 [2018-12-02 12:54:53,932 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-02 12:54:57,072 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-02 12:54:59,960 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-02 12:55:02,637 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-02 12:55:05,100 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-02 12:55:07,340 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-02 12:55:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:55:19,018 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-02 12:55:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:55:19,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-02 12:55:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:55:19,019 INFO L225 Difference]: With dead ends: 19 [2018-12-02 12:55:19,020 INFO L226 Difference]: Without dead ends: 16 [2018-12-02 12:55:19,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=36, Invalid=56, Unknown=20, NotChecked=230, Total=342 [2018-12-02 12:55:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-02 12:55:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-02 12:55:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 12:55:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-02 12:55:19,025 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-02 12:55:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:55:19,025 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-02 12:55:19,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 12:55:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-02 12:55:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 12:55:19,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:55:19,025 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:55:19,026 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:55:19,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:55:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2018-12-02 12:55:19,026 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:55:19,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-02 12:55:19,030 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-02 12:55:20,546 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-02 12:55:20,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:55:20,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:55:22,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= 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 (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 ((_ 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-02 12:55:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 12:55:22,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:55:25,232 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-02 12:55:27,461 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-02 12:55:29,916 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-02 12:55:32,377 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-02 12:55:35,051 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-02 12:55:37,717 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-02 12:55:40,617 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-02 12:55:43,505 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-02 12:55:46,625 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-02 12:55:49,768 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-02 12:55:53,064 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-02 12:55:56,397 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-02 12:55:56,420 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-02 12:55:56,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:55:56,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:55:56,451 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 12:56:34,069 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-12-02 12:56:34,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Forcibly destroying the process [2018-12-02 12:56:35,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:56:35,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-12-02 12:56:35,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 12:56:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 12:56:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=74, Unknown=13, NotChecked=154, Total=272 [2018-12-02 12:56:35,578 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 17 states. [2018-12-02 12:56:38,916 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-02 12:56:42,081 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-02 12:56:44,996 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-02 12:56:47,690 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-02 12:56:50,156 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-02 12:56:52,395 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-02 12:56:54,630 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))) (= 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 (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 ((_ 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-02 12:57:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:57:09,101 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-02 12:57:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:57:09,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-12-02 12:57:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:57:09,102 INFO L225 Difference]: With dead ends: 20 [2018-12-02 12:57:09,103 INFO L226 Difference]: Without dead ends: 17 [2018-12-02 12:57:09,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=45, Invalid=81, Unknown=20, NotChecked=406, Total=552 [2018-12-02 12:57:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-02 12:57:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 12:57:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 12:57:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-02 12:57:09,108 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-02 12:57:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:57:09,109 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-02 12:57:09,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 12:57:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-02 12:57:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 12:57:09,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:57:09,110 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:57:09,110 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:57:09,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:57:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2018-12-02 12:57:09,110 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:57:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-12-02 12:57:09,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:57:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:57:10,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:57:13,052 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 (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))))) is different from true [2018-12-02 12:57:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2018-12-02 12:57:13,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:57:15,327 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-02 12:57:19,077 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-02 12:57:21,528 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-02 12:57:24,205 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-02 12:57:26,881 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-02 12:57:29,804 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-02 12:57:32,718 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-02 12:57:35,885 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-02 12:57:39,034 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-02 12:57:42,384 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-02 12:57:45,751 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-02 12:57:49,530 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-02 12:57:53,336 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-02 12:57:53,363 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-02 12:57:53,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:57:53,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:57:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:58:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Forcibly destroying the process [2018-12-02 12:58:07,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:58:07,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-12-02 12:58:07,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 12:58:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 12:58:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=75, Unknown=14, NotChecked=184, Total=306 [2018-12-02 12:58:07,016 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 18 states. [2018-12-02 12:58:10,833 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-02 12:58:14,216 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-02 12:58:17,383 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-02 12:58:20,309 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-02 12:58:23,011 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-02 12:58:25,484 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-02 12:58:27,727 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-02 12:58:29,962 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 (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))))) is different from true [2018-12-02 12:58:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:58:33,811 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-02 12:58:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:58:33,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-12-02 12:58:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:58:33,812 INFO L225 Difference]: With dead ends: 21 [2018-12-02 12:58:33,812 INFO L226 Difference]: Without dead ends: 18 [2018-12-02 12:58:33,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=22, NotChecked=496, Total=650 [2018-12-02 12:58:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-02 12:58:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 12:58:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 12:58:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-02 12:58:33,818 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-02 12:58:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:58:33,819 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-02 12:58:33,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 12:58:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-02 12:58:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 12:58:33,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:58:33,819 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:58:33,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:58:33,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:58:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2018-12-02 12:58:33,820 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 12:58:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84de2f71-02f5-4086-b33b-088665162daf/bin-2019/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-12-02 12:58:33,829 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 12:58:35,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:58:35,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:58:35,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:58:37,979 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= 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 (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))) .cse0))) (= 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-02 12:58:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-12-02 12:58:37,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 12:58:40,271 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-02 12:58:42,496 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-02 12:58:44,971 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-02 12:58:47,441 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-02 12:58:50,160 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-02 12:58:52,877 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-02 12:58:55,799 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-02 12:58:58,763 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-02 12:59:01,920 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-02 12:59:05,076 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-02 12:59:06,889 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 12:59:07,090 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2018-12-02 12:59:07,091 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-02 12:59:07,096 INFO L168 Benchmark]: Toolchain (without parser) took 551607.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -118.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:59:07,098 INFO L168 Benchmark]: CDTParser took 0.13 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-02 12:59:07,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.00 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:59:07,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.25 ms. Allocated memory is still 1.0 GB. Free memory is still 931.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:59:07,099 INFO L168 Benchmark]: Boogie Preprocessor took 13.48 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:59:07,099 INFO L168 Benchmark]: RCFGBuilder took 2315.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:59:07,099 INFO L168 Benchmark]: TraceAbstraction took 549129.57 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:59:07,101 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.13 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 133.00 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.3 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 931.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.48 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2315.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 549129.57 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 16.6 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...